java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:54:58,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:54:58,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:54:58,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:54:58,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:54:58,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:54:58,385 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:54:58,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:54:58,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:54:58,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:54:58,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:54:58,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:54:58,391 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:54:58,392 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:54:58,393 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:54:58,394 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:54:58,395 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:54:58,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:54:58,399 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:54:58,401 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:54:58,402 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:54:58,403 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:54:58,406 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:54:58,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:54:58,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:54:58,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:54:58,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:54:58,409 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:54:58,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:54:58,411 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:54:58,412 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:54:58,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:54:58,413 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:54:58,413 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:54:58,414 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:54:58,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:54:58,415 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 19:54:58,434 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:54:58,436 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:54:58,437 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:54:58,437 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:54:58,438 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:54:58,439 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:54:58,439 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:54:58,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:54:58,439 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:54:58,439 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:54:58,440 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:54:58,440 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:54:58,440 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:54:58,441 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:54:58,441 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:54:58,441 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:54:58,441 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:54:58,441 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:54:58,442 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:54:58,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:54:58,442 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:54:58,443 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:54:58,443 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:54:58,443 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:54:58,443 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:54:58,443 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:54:58,444 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:54:58,444 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:54:58,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:54:58,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:54:58,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:54:58,513 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:54:58,514 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:54:58,514 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c [2018-10-26 19:54:58,579 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0c3c517ca/1e9f7278e09740f5b44011c13b558756/FLAG16a53f13c [2018-10-26 19:54:59,221 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:54:59,222 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c [2018-10-26 19:54:59,251 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0c3c517ca/1e9f7278e09740f5b44011c13b558756/FLAG16a53f13c [2018-10-26 19:54:59,267 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0c3c517ca/1e9f7278e09740f5b44011c13b558756 [2018-10-26 19:54:59,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:54:59,277 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:54:59,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:54:59,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:54:59,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:54:59,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:54:59" (1/1) ... [2018-10-26 19:54:59,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2e66ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:59, skipping insertion in model container [2018-10-26 19:54:59,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:54:59" (1/1) ... [2018-10-26 19:54:59,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:54:59,358 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:54:59,807 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:54:59,815 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:54:59,932 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:54:59,950 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:54:59,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:59 WrapperNode [2018-10-26 19:54:59,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:54:59,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:54:59,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:54:59,952 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:54:59,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:59" (1/1) ... [2018-10-26 19:54:59,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:59" (1/1) ... [2018-10-26 19:55:00,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:55:00,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:55:00,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:55:00,147 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:55:00,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:59" (1/1) ... [2018-10-26 19:55:00,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:59" (1/1) ... [2018-10-26 19:55:00,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:59" (1/1) ... [2018-10-26 19:55:00,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:59" (1/1) ... [2018-10-26 19:55:00,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:59" (1/1) ... [2018-10-26 19:55:00,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:59" (1/1) ... [2018-10-26 19:55:00,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:59" (1/1) ... [2018-10-26 19:55:00,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:55:00,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:55:00,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:55:00,229 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:55:00,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/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 [2018-10-26 19:55:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:55:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:55:00,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:55:03,596 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:55:03,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:55:03 BoogieIcfgContainer [2018-10-26 19:55:03,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:55:03,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:55:03,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:55:03,605 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:55:03,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:54:59" (1/3) ... [2018-10-26 19:55:03,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79049688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:55:03, skipping insertion in model container [2018-10-26 19:55:03,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:59" (2/3) ... [2018-10-26 19:55:03,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79049688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:55:03, skipping insertion in model container [2018-10-26 19:55:03,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:55:03" (3/3) ... [2018-10-26 19:55:03,611 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label23_true-unreach-call_false-termination.c [2018-10-26 19:55:03,624 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:55:03,639 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:55:03,660 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:55:03,709 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:55:03,710 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:55:03,710 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:55:03,710 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:55:03,711 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:55:03,712 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:55:03,712 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:55:03,712 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:55:03,713 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:55:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-26 19:55:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-26 19:55:03,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:03,767 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:03,770 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:03,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:03,780 INFO L82 PathProgramCache]: Analyzing trace with hash 796168207, now seen corresponding path program 1 times [2018-10-26 19:55:03,783 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:55:03,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:55:03,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:03,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:03,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:04,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:04,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:55:04,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:55:04,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:55:04,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:55:04,506 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-10-26 19:55:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:06,678 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-10-26 19:55:06,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:55:06,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-10-26 19:55:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:06,702 INFO L225 Difference]: With dead ends: 666 [2018-10-26 19:55:06,702 INFO L226 Difference]: Without dead ends: 460 [2018-10-26 19:55:06,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:55:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-26 19:55:06,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-10-26 19:55:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-26 19:55:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 736 transitions. [2018-10-26 19:55:06,793 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 736 transitions. Word has length 96 [2018-10-26 19:55:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:06,794 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 736 transitions. [2018-10-26 19:55:06,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:55:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 736 transitions. [2018-10-26 19:55:06,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-26 19:55:06,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:06,801 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:06,801 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:06,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:06,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1501969501, now seen corresponding path program 1 times [2018-10-26 19:55:06,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:55:06,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:55:06,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:06,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:06,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:07,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:07,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:55:07,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:55:07,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:55:07,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:55:07,191 INFO L87 Difference]: Start difference. First operand 460 states and 736 transitions. Second operand 4 states. [2018-10-26 19:55:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:08,681 INFO L93 Difference]: Finished difference Result 1710 states and 2816 transitions. [2018-10-26 19:55:08,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:55:08,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-10-26 19:55:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:08,691 INFO L225 Difference]: With dead ends: 1710 [2018-10-26 19:55:08,692 INFO L226 Difference]: Without dead ends: 1252 [2018-10-26 19:55:08,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:55:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-10-26 19:55:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2018-10-26 19:55:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-10-26 19:55:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1792 transitions. [2018-10-26 19:55:08,761 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1792 transitions. Word has length 104 [2018-10-26 19:55:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:08,762 INFO L481 AbstractCegarLoop]: Abstraction has 1252 states and 1792 transitions. [2018-10-26 19:55:08,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:55:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1792 transitions. [2018-10-26 19:55:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 19:55:08,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:08,771 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:08,771 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:08,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1833354720, now seen corresponding path program 1 times [2018-10-26 19:55:08,771 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:55:08,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:55:08,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:08,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:08,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:09,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:09,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:55:09,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:55:09,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:55:09,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:55:09,092 INFO L87 Difference]: Start difference. First operand 1252 states and 1792 transitions. Second operand 4 states. [2018-10-26 19:55:12,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:12,641 INFO L93 Difference]: Finished difference Result 2502 states and 3582 transitions. [2018-10-26 19:55:12,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:55:12,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-10-26 19:55:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:12,649 INFO L225 Difference]: With dead ends: 2502 [2018-10-26 19:55:12,650 INFO L226 Difference]: Without dead ends: 1112 [2018-10-26 19:55:12,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:55:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2018-10-26 19:55:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2018-10-26 19:55:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2018-10-26 19:55:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1373 transitions. [2018-10-26 19:55:12,675 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1373 transitions. Word has length 118 [2018-10-26 19:55:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:12,675 INFO L481 AbstractCegarLoop]: Abstraction has 1112 states and 1373 transitions. [2018-10-26 19:55:12,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:55:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1373 transitions. [2018-10-26 19:55:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 19:55:12,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:12,679 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:12,679 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:12,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:12,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1074721094, now seen corresponding path program 1 times [2018-10-26 19:55:12,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:55:12,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:55:12,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:12,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:12,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:12,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:12,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:55:12,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:55:12,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:55:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:55:12,776 INFO L87 Difference]: Start difference. First operand 1112 states and 1373 transitions. Second operand 3 states. [2018-10-26 19:55:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:13,483 INFO L93 Difference]: Finished difference Result 3278 states and 4062 transitions. [2018-10-26 19:55:13,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:55:13,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2018-10-26 19:55:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:13,494 INFO L225 Difference]: With dead ends: 3278 [2018-10-26 19:55:13,494 INFO L226 Difference]: Without dead ends: 2168 [2018-10-26 19:55:13,496 INFO L605 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 [2018-10-26 19:55:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-10-26 19:55:13,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2018-10-26 19:55:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2018-10-26 19:55:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2589 transitions. [2018-10-26 19:55:13,536 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2589 transitions. Word has length 119 [2018-10-26 19:55:13,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:13,537 INFO L481 AbstractCegarLoop]: Abstraction has 2168 states and 2589 transitions. [2018-10-26 19:55:13,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:55:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2589 transitions. [2018-10-26 19:55:13,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:55:13,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:13,540 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:13,541 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:13,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:13,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1859070878, now seen corresponding path program 1 times [2018-10-26 19:55:13,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:55:13,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:55:13,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:13,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:13,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 19:55:13,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:13,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:55:13,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:55:13,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:55:13,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:55:13,627 INFO L87 Difference]: Start difference. First operand 2168 states and 2589 transitions. Second operand 3 states. [2018-10-26 19:55:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:14,733 INFO L93 Difference]: Finished difference Result 6446 states and 7710 transitions. [2018-10-26 19:55:14,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:55:14,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-10-26 19:55:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:14,753 INFO L225 Difference]: With dead ends: 6446 [2018-10-26 19:55:14,753 INFO L226 Difference]: Without dead ends: 4280 [2018-10-26 19:55:14,757 INFO L605 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 [2018-10-26 19:55:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2018-10-26 19:55:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2018-10-26 19:55:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2018-10-26 19:55:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5015 transitions. [2018-10-26 19:55:14,827 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5015 transitions. Word has length 124 [2018-10-26 19:55:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:14,828 INFO L481 AbstractCegarLoop]: Abstraction has 4280 states and 5015 transitions. [2018-10-26 19:55:14,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:55:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5015 transitions. [2018-10-26 19:55:14,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-26 19:55:14,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:14,833 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:14,833 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:14,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:14,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1757434484, now seen corresponding path program 1 times [2018-10-26 19:55:14,834 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:55:14,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:55:14,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:14,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:14,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:55:14,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:14,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:55:14,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:55:14,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:55:14,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:55:14,968 INFO L87 Difference]: Start difference. First operand 4280 states and 5015 transitions. Second operand 3 states. [2018-10-26 19:55:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:15,866 INFO L93 Difference]: Finished difference Result 9218 states and 10823 transitions. [2018-10-26 19:55:15,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:55:15,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-10-26 19:55:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:15,884 INFO L225 Difference]: With dead ends: 9218 [2018-10-26 19:55:15,884 INFO L226 Difference]: Without dead ends: 4404 [2018-10-26 19:55:15,891 INFO L605 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 [2018-10-26 19:55:15,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4404 states. [2018-10-26 19:55:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4404 to 4404. [2018-10-26 19:55:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2018-10-26 19:55:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 5024 transitions. [2018-10-26 19:55:15,960 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 5024 transitions. Word has length 126 [2018-10-26 19:55:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:15,960 INFO L481 AbstractCegarLoop]: Abstraction has 4404 states and 5024 transitions. [2018-10-26 19:55:15,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:55:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 5024 transitions. [2018-10-26 19:55:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-26 19:55:15,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:15,965 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:15,966 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:15,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:15,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1191737420, now seen corresponding path program 1 times [2018-10-26 19:55:15,966 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:55:15,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:55:15,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:15,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:15,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:16,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:16,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:55:16,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:55:16,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:55:16,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:55:16,121 INFO L87 Difference]: Start difference. First operand 4404 states and 5024 transitions. Second operand 3 states. [2018-10-26 19:55:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:16,694 INFO L93 Difference]: Finished difference Result 8806 states and 10046 transitions. [2018-10-26 19:55:16,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:55:16,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-10-26 19:55:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:16,711 INFO L225 Difference]: With dead ends: 8806 [2018-10-26 19:55:16,711 INFO L226 Difference]: Without dead ends: 4404 [2018-10-26 19:55:16,717 INFO L605 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 [2018-10-26 19:55:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4404 states. [2018-10-26 19:55:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4404 to 4404. [2018-10-26 19:55:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2018-10-26 19:55:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 5000 transitions. [2018-10-26 19:55:16,794 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 5000 transitions. Word has length 126 [2018-10-26 19:55:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:16,794 INFO L481 AbstractCegarLoop]: Abstraction has 4404 states and 5000 transitions. [2018-10-26 19:55:16,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:55:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 5000 transitions. [2018-10-26 19:55:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-26 19:55:16,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:16,800 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:16,801 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:16,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:16,801 INFO L82 PathProgramCache]: Analyzing trace with hash -734624348, now seen corresponding path program 1 times [2018-10-26 19:55:16,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:55:16,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:55:16,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:16,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:16,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:17,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:17,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 19:55:17,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 19:55:17,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 19:55:17,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:55:17,119 INFO L87 Difference]: Start difference. First operand 4404 states and 5000 transitions. Second operand 7 states. [2018-10-26 19:55:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:21,368 INFO L93 Difference]: Finished difference Result 8878 states and 10070 transitions. [2018-10-26 19:55:21,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 19:55:21,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2018-10-26 19:55:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:21,383 INFO L225 Difference]: With dead ends: 8878 [2018-10-26 19:55:21,383 INFO L226 Difference]: Without dead ends: 4476 [2018-10-26 19:55:21,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:55:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4476 states. [2018-10-26 19:55:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4476 to 4404. [2018-10-26 19:55:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2018-10-26 19:55:21,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 4988 transitions. [2018-10-26 19:55:21,452 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 4988 transitions. Word has length 131 [2018-10-26 19:55:21,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:21,452 INFO L481 AbstractCegarLoop]: Abstraction has 4404 states and 4988 transitions. [2018-10-26 19:55:21,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 19:55:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 4988 transitions. [2018-10-26 19:55:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-26 19:55:21,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:21,458 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:21,459 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:21,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:21,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1550286434, now seen corresponding path program 1 times [2018-10-26 19:55:21,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:55:21,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:55:21,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:21,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:21,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-26 19:55:21,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:21,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:55:21,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:55:21,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:55:21,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:55:21,612 INFO L87 Difference]: Start difference. First operand 4404 states and 4988 transitions. Second operand 3 states. [2018-10-26 19:55:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:22,338 INFO L93 Difference]: Finished difference Result 8806 states and 9974 transitions. [2018-10-26 19:55:22,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:55:22,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2018-10-26 19:55:22,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:22,348 INFO L225 Difference]: With dead ends: 8806 [2018-10-26 19:55:22,348 INFO L226 Difference]: Without dead ends: 3332 [2018-10-26 19:55:22,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:55:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2018-10-26 19:55:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 3200. [2018-10-26 19:55:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3200 states. [2018-10-26 19:55:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 3472 transitions. [2018-10-26 19:55:22,394 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 3472 transitions. Word has length 156 [2018-10-26 19:55:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:22,394 INFO L481 AbstractCegarLoop]: Abstraction has 3200 states and 3472 transitions. [2018-10-26 19:55:22,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:55:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 3472 transitions. [2018-10-26 19:55:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-26 19:55:22,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:22,398 INFO L375 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, 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, 1, 1] [2018-10-26 19:55:22,399 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:22,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:22,399 INFO L82 PathProgramCache]: Analyzing trace with hash -971560095, now seen corresponding path program 1 times [2018-10-26 19:55:22,399 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:55:22,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:55:22,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:22,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:22,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:22,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:22,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:55:22,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:55:22,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:55:22,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:55:22,587 INFO L87 Difference]: Start difference. First operand 3200 states and 3472 transitions. Second operand 4 states. [2018-10-26 19:55:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:23,519 INFO L93 Difference]: Finished difference Result 6130 states and 6666 transitions. [2018-10-26 19:55:23,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:55:23,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-10-26 19:55:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:23,530 INFO L225 Difference]: With dead ends: 6130 [2018-10-26 19:55:23,530 INFO L226 Difference]: Without dead ends: 2932 [2018-10-26 19:55:23,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:55:23,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2018-10-26 19:55:23,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2932. [2018-10-26 19:55:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2932 states. [2018-10-26 19:55:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 3128 transitions. [2018-10-26 19:55:23,570 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 3128 transitions. Word has length 156 [2018-10-26 19:55:23,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:23,571 INFO L481 AbstractCegarLoop]: Abstraction has 2932 states and 3128 transitions. [2018-10-26 19:55:23,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:55:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 3128 transitions. [2018-10-26 19:55:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-26 19:55:23,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:23,575 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 19:55:23,575 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:23,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:23,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1223728710, now seen corresponding path program 1 times [2018-10-26 19:55:23,576 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:55:23,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:55:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:23,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 19:55:23,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:23,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:55:23,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:55:23,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:55:23,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:55:23,811 INFO L87 Difference]: Start difference. First operand 2932 states and 3128 transitions. Second operand 4 states. [2018-10-26 19:55:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:24,305 INFO L93 Difference]: Finished difference Result 5594 states and 5975 transitions. [2018-10-26 19:55:24,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:55:24,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-10-26 19:55:24,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:24,306 INFO L225 Difference]: With dead ends: 5594 [2018-10-26 19:55:24,306 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 19:55:24,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:55:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 19:55:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 19:55:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 19:55:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 19:55:24,311 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2018-10-26 19:55:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:24,312 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 19:55:24,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:55:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 19:55:24,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 19:55:24,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 19:55:24,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:55:24,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:55:24,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:55:24,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:55:24,655 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-10-26 19:55:24,882 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-10-26 19:55:24,887 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-26 19:55:24,887 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-26 19:55:24,888 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,888 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,888 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,888 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,888 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,888 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,888 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-26 19:55:24,888 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-26 19:55:24,888 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-26 19:55:24,889 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-26 19:55:24,889 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-26 19:55:24,889 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-26 19:55:24,889 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-26 19:55:24,889 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-26 19:55:24,889 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-26 19:55:24,889 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-26 19:55:24,889 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,889 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,889 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,890 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,890 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,890 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,890 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-26 19:55:24,890 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-26 19:55:24,890 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-26 19:55:24,890 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-26 19:55:24,890 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-26 19:55:24,891 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-26 19:55:24,891 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-26 19:55:24,891 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-26 19:55:24,891 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-26 19:55:24,891 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-26 19:55:24,891 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-26 19:55:24,891 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-26 19:55:24,891 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-26 19:55:24,891 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-26 19:55:24,892 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-26 19:55:24,892 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,892 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,892 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,892 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,892 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,892 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-26 19:55:24,892 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-26 19:55:24,892 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-26 19:55:24,893 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-26 19:55:24,893 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-26 19:55:24,893 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-26 19:55:24,893 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-26 19:55:24,893 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-26 19:55:24,893 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-26 19:55:24,894 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= ~a8~0 15))) (let ((.cse5 (<= ~a20~0 0)) (.cse4 (= ~a17~0 1)) (.cse2 (= ~a16~0 5)) (.cse0 (= ~a8~0 13)) (.cse6 (<= ~a17~0 0)) (.cse8 (not .cse3)) (.cse1 (= ~a21~0 1)) (.cse7 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1 .cse5) (and .cse6 .cse1 .cse7) (and .cse0 .cse4 .cse7) (and .cse0 .cse4 .cse5) (and .cse8 (not .cse0) .cse2) (and .cse6 .cse1 .cse5) (and .cse4 .cse1 .cse7 .cse2) (and .cse0 .cse6 .cse7) (and .cse8 .cse1 .cse7)))) [2018-10-26 19:55:24,894 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,894 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,894 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,894 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,894 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,894 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-26 19:55:24,895 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 461) no Hoare annotation was computed. [2018-10-26 19:55:24,895 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-26 19:55:24,895 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-26 19:55:24,895 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-26 19:55:24,895 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-26 19:55:24,895 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-26 19:55:24,895 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-26 19:55:24,896 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-26 19:55:24,896 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-26 19:55:24,896 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-26 19:55:24,896 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-26 19:55:24,896 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-26 19:55:24,896 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-26 19:55:24,896 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-26 19:55:24,896 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,896 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,896 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,896 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,896 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,896 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-26 19:55:24,896 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-26 19:55:24,897 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-26 19:55:24,898 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-26 19:55:24,898 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-26 19:55:24,898 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-26 19:55:24,898 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-26 19:55:24,898 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-26 19:55:24,898 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-26 19:55:24,899 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-26 19:55:24,899 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-26 19:55:24,899 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-26 19:55:24,899 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-26 19:55:24,899 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-26 19:55:24,899 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-26 19:55:24,899 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-26 19:55:24,900 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,900 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,900 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,900 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a8~0 15))) (let ((.cse5 (<= ~a20~0 0)) (.cse4 (= ~a17~0 1)) (.cse2 (= ~a16~0 5)) (.cse0 (= ~a8~0 13)) (.cse6 (<= ~a17~0 0)) (.cse8 (not .cse3)) (.cse1 (= ~a21~0 1)) (.cse7 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1 .cse5) (and .cse6 .cse1 .cse7) (and .cse0 .cse4 .cse7) (and .cse0 .cse4 .cse5) (and .cse8 (not .cse0) .cse2) (and .cse6 .cse1 .cse5) (and .cse4 .cse1 .cse7 .cse2) (and .cse0 .cse6 .cse7) (and .cse8 .cse1 .cse7)))) [2018-10-26 19:55:24,900 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,900 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,900 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-26 19:55:24,900 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-26 19:55:24,901 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-26 19:55:24,901 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-26 19:55:24,901 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-26 19:55:24,901 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-26 19:55:24,901 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-26 19:55:24,901 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-26 19:55:24,901 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,901 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,902 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,902 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,902 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,902 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-26 19:55:24,902 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:55:24,902 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-26 19:55:24,902 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-26 19:55:24,902 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-26 19:55:24,902 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-26 19:55:24,902 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-26 19:55:24,902 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-26 19:55:24,902 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-26 19:55:24,902 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-26 19:55:24,903 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-26 19:55:24,904 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-26 19:55:24,905 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,906 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,906 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,906 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,906 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,906 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-26 19:55:24,906 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-26 19:55:24,906 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-26 19:55:24,906 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-26 19:55:24,906 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-26 19:55:24,906 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-26 19:55:24,906 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-26 19:55:24,907 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-26 19:55:24,907 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-26 19:55:24,907 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-26 19:55:24,907 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-26 19:55:24,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:55:24 BoogieIcfgContainer [2018-10-26 19:55:24,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:55:24,930 INFO L168 Benchmark]: Toolchain (without parser) took 25653.77 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -430.9 MB). Peak memory consumption was 665.4 MB. Max. memory is 7.1 GB. [2018-10-26 19:55:24,932 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 19:55:24,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-26 19:55:24,933 INFO L168 Benchmark]: Boogie Procedure Inliner took 194.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.7 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-26 19:55:24,934 INFO L168 Benchmark]: Boogie Preprocessor took 81.96 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 19:55:24,934 INFO L168 Benchmark]: RCFGBuilder took 3370.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.3 MB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB. [2018-10-26 19:55:24,935 INFO L168 Benchmark]: TraceAbstraction took 21328.37 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 362.3 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 228.8 MB). Peak memory consumption was 591.0 MB. Max. memory is 7.1 GB. [2018-10-26 19:55:24,940 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 672.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 194.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.7 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.96 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3370.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.3 MB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21328.37 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 362.3 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 228.8 MB). Peak memory consumption was 591.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((a8 == 13 && a21 == 1) && a16 == 5) || (((a8 == 15 && a17 == 1) && a21 == 1) && a20 <= 0)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a8 == 13 && a17 == 1) && a20 == 1)) || ((a8 == 13 && a17 == 1) && a20 <= 0)) || ((!(a8 == 15) && !(a8 == 13)) && a16 == 5)) || ((a17 <= 0 && a21 == 1) && a20 <= 0)) || (((a17 == 1 && a21 == 1) && a20 == 1) && a16 == 5)) || ((a8 == 13 && a17 <= 0) && a20 == 1)) || ((!(a8 == 15) && a21 == 1) && a20 == 1) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((a8 == 13 && a21 == 1) && a16 == 5) || (((a8 == 15 && a17 == 1) && a21 == 1) && a20 <= 0)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a8 == 13 && a17 == 1) && a20 == 1)) || ((a8 == 13 && a17 == 1) && a20 <= 0)) || ((!(a8 == 15) && !(a8 == 13)) && a16 == 5)) || ((a17 <= 0 && a21 == 1) && a20 <= 0)) || (((a17 == 1 && a21 == 1) && a20 == 1) && a16 == 5)) || ((a8 == 13 && a17 <= 0) && a20 == 1)) || ((!(a8 == 15) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 21.2s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 17.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1625 SDtfs, 2760 SDslu, 540 SDs, 0 SdLazy, 5757 SolverSat, 1252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4404occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 204 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 72 NumberOfFragments, 221 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1714 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 20 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1426 NumberOfCodeBlocks, 1426 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1415 ConstructedInterpolants, 0 QuantifiedInterpolants, 434127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 472/472 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...