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/Problem12_label27_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:18:17,392 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:18:17,394 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:18:17,406 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:18:17,407 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:18:17,408 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:18:17,409 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:18:17,411 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:18:17,413 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:18:17,414 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:18:17,415 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:18:17,415 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:18:17,416 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:18:17,417 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:18:17,418 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:18:17,419 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:18:17,420 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:18:17,422 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:18:17,424 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:18:17,426 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:18:17,427 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:18:17,428 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:18:17,431 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:18:17,431 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:18:17,431 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:18:17,432 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:18:17,433 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:18:17,434 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:18:17,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:18:17,436 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:18:17,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:18:17,437 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:18:17,437 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:18:17,438 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:18:17,439 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:18:17,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:18:17,440 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 21:18:17,467 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:18:17,467 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:18:17,468 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:18:17,468 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:18:17,469 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:18:17,469 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:18:17,469 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:18:17,470 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:18:17,470 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:18:17,470 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:18:17,470 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:18:17,470 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:18:17,471 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:18:17,471 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:18:17,471 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:18:17,471 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:18:17,472 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:18:17,472 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:18:17,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:18:17,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:18:17,472 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:18:17,472 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:18:17,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:18:17,473 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:18:17,473 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:18:17,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:18:17,474 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:18:17,474 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:18:17,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:18:17,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:18:17,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:18:17,561 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:18:17,561 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:18:17,562 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label27_true-unreach-call.c [2018-10-26 21:18:17,629 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/00cf2b943/188759adae1940de9bae6177fe7c64c2/FLAG6b6783e6a [2018-10-26 21:18:18,396 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:18:18,397 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label27_true-unreach-call.c [2018-10-26 21:18:18,428 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/00cf2b943/188759adae1940de9bae6177fe7c64c2/FLAG6b6783e6a [2018-10-26 21:18:18,448 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/00cf2b943/188759adae1940de9bae6177fe7c64c2 [2018-10-26 21:18:18,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:18:18,464 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:18:18,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:18:18,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:18:18,472 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:18:18,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:18:18" (1/1) ... [2018-10-26 21:18:18,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c15c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:18:18, skipping insertion in model container [2018-10-26 21:18:18,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:18:18" (1/1) ... [2018-10-26 21:18:18,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:18:18,655 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:18:19,854 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:18:19,860 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:18:20,462 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:18:20,501 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:18:20,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:18:20 WrapperNode [2018-10-26 21:18:20,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:18:20,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:18:20,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:18:20,506 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:18:20,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:18:20" (1/1) ... [2018-10-26 21:18:20,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:18:20" (1/1) ... [2018-10-26 21:18:21,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:18:21,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:18:21,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:18:21,187 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:18:21,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:18:20" (1/1) ... [2018-10-26 21:18:21,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:18:20" (1/1) ... [2018-10-26 21:18:21,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:18:20" (1/1) ... [2018-10-26 21:18:21,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:18:20" (1/1) ... [2018-10-26 21:18:21,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:18:20" (1/1) ... [2018-10-26 21:18:21,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:18:20" (1/1) ... [2018-10-26 21:18:21,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:18:20" (1/1) ... [2018-10-26 21:18:21,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:18:21,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:18:21,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:18:21,523 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:18:21,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:18:20" (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 21:18:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:18:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:18:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:18:29,985 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:18:29,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:18:29 BoogieIcfgContainer [2018-10-26 21:18:29,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:18:29,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:18:29,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:18:29,991 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:18:29,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:18:18" (1/3) ... [2018-10-26 21:18:29,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d4dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:18:29, skipping insertion in model container [2018-10-26 21:18:29,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:18:20" (2/3) ... [2018-10-26 21:18:29,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d4dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:18:29, skipping insertion in model container [2018-10-26 21:18:29,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:18:29" (3/3) ... [2018-10-26 21:18:30,000 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label27_true-unreach-call.c [2018-10-26 21:18:30,009 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:18:30,023 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:18:30,042 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:18:30,102 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:18:30,102 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:18:30,102 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:18:30,103 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:18:30,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:18:30,103 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:18:30,103 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:18:30,103 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:18:30,103 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:18:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-10-26 21:18:30,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 21:18:30,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:18:30,151 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] [2018-10-26 21:18:30,154 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:18:30,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:18:30,160 INFO L82 PathProgramCache]: Analyzing trace with hash 18549650, now seen corresponding path program 1 times [2018-10-26 21:18:30,162 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:18:30,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:18:30,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:18:30,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:18:30,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:18:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:18:30,585 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 21:18:30,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:18:30,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:18:30,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:18:30,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:18:30,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:18:30,614 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 4 states. [2018-10-26 21:18:46,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:18:46,194 INFO L93 Difference]: Finished difference Result 3162 states and 6150 transitions. [2018-10-26 21:18:46,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:18:46,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-10-26 21:18:46,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:18:46,239 INFO L225 Difference]: With dead ends: 3162 [2018-10-26 21:18:46,239 INFO L226 Difference]: Without dead ends: 2336 [2018-10-26 21:18:46,246 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 21:18:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2018-10-26 21:18:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 1568. [2018-10-26 21:18:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2018-10-26 21:18:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2556 transitions. [2018-10-26 21:18:46,390 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2556 transitions. Word has length 32 [2018-10-26 21:18:46,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:18:46,391 INFO L481 AbstractCegarLoop]: Abstraction has 1568 states and 2556 transitions. [2018-10-26 21:18:46,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:18:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2556 transitions. [2018-10-26 21:18:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 21:18:46,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:18:46,397 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] [2018-10-26 21:18:46,397 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:18:46,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:18:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash 347203639, now seen corresponding path program 1 times [2018-10-26 21:18:46,398 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:18:46,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:18:46,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:18:46,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:18:46,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:18:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:18:46,759 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 21:18:46,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:18:46,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:18:46,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:18:46,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:18:46,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:18:46,762 INFO L87 Difference]: Start difference. First operand 1568 states and 2556 transitions. Second operand 4 states. [2018-10-26 21:18:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:18:57,675 INFO L93 Difference]: Finished difference Result 6142 states and 10096 transitions. [2018-10-26 21:18:57,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:18:57,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-10-26 21:18:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:18:57,699 INFO L225 Difference]: With dead ends: 6142 [2018-10-26 21:18:57,699 INFO L226 Difference]: Without dead ends: 4576 [2018-10-26 21:18:57,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 21:18:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2018-10-26 21:18:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 4576. [2018-10-26 21:18:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4576 states. [2018-10-26 21:18:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4576 states to 4576 states and 6531 transitions. [2018-10-26 21:18:57,789 INFO L78 Accepts]: Start accepts. Automaton has 4576 states and 6531 transitions. Word has length 108 [2018-10-26 21:18:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:18:57,790 INFO L481 AbstractCegarLoop]: Abstraction has 4576 states and 6531 transitions. [2018-10-26 21:18:57,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:18:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4576 states and 6531 transitions. [2018-10-26 21:18:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 21:18:57,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:18:57,795 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] [2018-10-26 21:18:57,795 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:18:57,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:18:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash 633186002, now seen corresponding path program 1 times [2018-10-26 21:18:57,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:18:57,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:18:57,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:18:57,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:18:57,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:18:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:18:58,126 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 21:18:58,386 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 21:18:58,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:18:58,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:18:58,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:18:58,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:18:58,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:18:58,387 INFO L87 Difference]: Start difference. First operand 4576 states and 6531 transitions. Second operand 6 states. [2018-10-26 21:19:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:19:10,523 INFO L93 Difference]: Finished difference Result 15166 states and 21142 transitions. [2018-10-26 21:19:10,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:19:10,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-10-26 21:19:10,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:19:10,575 INFO L225 Difference]: With dead ends: 15166 [2018-10-26 21:19:10,576 INFO L226 Difference]: Without dead ends: 10592 [2018-10-26 21:19:10,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:19:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10592 states. [2018-10-26 21:19:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10592 to 10592. [2018-10-26 21:19:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10592 states. [2018-10-26 21:19:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10592 states to 10592 states and 14292 transitions. [2018-10-26 21:19:10,770 INFO L78 Accepts]: Start accepts. Automaton has 10592 states and 14292 transitions. Word has length 110 [2018-10-26 21:19:10,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:19:10,770 INFO L481 AbstractCegarLoop]: Abstraction has 10592 states and 14292 transitions. [2018-10-26 21:19:10,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:19:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 10592 states and 14292 transitions. [2018-10-26 21:19:10,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 21:19:10,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:19:10,777 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, 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] [2018-10-26 21:19:10,778 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:19:10,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:19:10,778 INFO L82 PathProgramCache]: Analyzing trace with hash 443921409, now seen corresponding path program 1 times [2018-10-26 21:19:10,778 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:19:10,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:19:10,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:10,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:19:10,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:19:11,320 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-26 21:19:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 125 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:19:11,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:19:11,456 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:19:11,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:19:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:19:11,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:19:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:19:11,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:19:11,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-26 21:19:11,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:19:11,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:19:11,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:19:11,686 INFO L87 Difference]: Start difference. First operand 10592 states and 14292 transitions. Second operand 7 states. [2018-10-26 21:19:12,839 WARN L179 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-10-26 21:19:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:19:34,177 INFO L93 Difference]: Finished difference Result 41518 states and 54744 transitions. [2018-10-26 21:19:34,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:19:34,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2018-10-26 21:19:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:19:34,261 INFO L225 Difference]: With dead ends: 41518 [2018-10-26 21:19:34,261 INFO L226 Difference]: Without dead ends: 29421 [2018-10-26 21:19:34,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:19:34,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29421 states. [2018-10-26 21:19:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29421 to 20367. [2018-10-26 21:19:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20367 states. [2018-10-26 21:19:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20367 states to 20367 states and 25010 transitions. [2018-10-26 21:19:34,722 INFO L78 Accepts]: Start accepts. Automaton has 20367 states and 25010 transitions. Word has length 182 [2018-10-26 21:19:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:19:34,722 INFO L481 AbstractCegarLoop]: Abstraction has 20367 states and 25010 transitions. [2018-10-26 21:19:34,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:19:34,723 INFO L276 IsEmpty]: Start isEmpty. Operand 20367 states and 25010 transitions. [2018-10-26 21:19:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-26 21:19:34,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:19:34,732 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, 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, 1, 1, 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 21:19:34,732 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:19:34,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:19:34,733 INFO L82 PathProgramCache]: Analyzing trace with hash -454335340, now seen corresponding path program 1 times [2018-10-26 21:19:34,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:19:34,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:19:34,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:34,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:19:34,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:19:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-26 21:19:35,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:19:35,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:19:35,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:19:35,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:19:35,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:19:35,116 INFO L87 Difference]: Start difference. First operand 20367 states and 25010 transitions. Second operand 3 states. [2018-10-26 21:19:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:19:40,656 INFO L93 Difference]: Finished difference Result 46748 states and 57858 transitions. [2018-10-26 21:19:40,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:19:40,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2018-10-26 21:19:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:19:40,704 INFO L225 Difference]: With dead ends: 46748 [2018-10-26 21:19:40,704 INFO L226 Difference]: Without dead ends: 27135 [2018-10-26 21:19:40,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 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 21:19:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27135 states. [2018-10-26 21:19:41,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27135 to 27135. [2018-10-26 21:19:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27135 states. [2018-10-26 21:19:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27135 states to 27135 states and 32871 transitions. [2018-10-26 21:19:41,138 INFO L78 Accepts]: Start accepts. Automaton has 27135 states and 32871 transitions. Word has length 264 [2018-10-26 21:19:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:19:41,139 INFO L481 AbstractCegarLoop]: Abstraction has 27135 states and 32871 transitions. [2018-10-26 21:19:41,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:19:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 27135 states and 32871 transitions. [2018-10-26 21:19:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-26 21:19:41,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:19:41,147 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 3, 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] [2018-10-26 21:19:41,147 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:19:41,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:19:41,148 INFO L82 PathProgramCache]: Analyzing trace with hash -410168344, now seen corresponding path program 1 times [2018-10-26 21:19:41,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:19:41,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:19:41,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:41,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:19:41,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:19:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-26 21:19:41,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:19:41,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:19:41,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:19:41,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:19:41,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:19:41,482 INFO L87 Difference]: Start difference. First operand 27135 states and 32871 transitions. Second operand 3 states. [2018-10-26 21:19:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:19:48,655 INFO L93 Difference]: Finished difference Result 53516 states and 64983 transitions. [2018-10-26 21:19:48,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:19:48,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2018-10-26 21:19:48,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:19:48,698 INFO L225 Difference]: With dead ends: 53516 [2018-10-26 21:19:48,698 INFO L226 Difference]: Without dead ends: 27135 [2018-10-26 21:19:48,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 21:19:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27135 states. [2018-10-26 21:19:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27135 to 25631. [2018-10-26 21:19:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25631 states. [2018-10-26 21:19:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25631 states to 25631 states and 29966 transitions. [2018-10-26 21:19:49,420 INFO L78 Accepts]: Start accepts. Automaton has 25631 states and 29966 transitions. Word has length 334 [2018-10-26 21:19:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:19:49,421 INFO L481 AbstractCegarLoop]: Abstraction has 25631 states and 29966 transitions. [2018-10-26 21:19:49,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:19:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 25631 states and 29966 transitions. [2018-10-26 21:19:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-26 21:19:49,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:19:49,430 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:19:49,430 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:19:49,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:19:49,431 INFO L82 PathProgramCache]: Analyzing trace with hash -262376094, now seen corresponding path program 1 times [2018-10-26 21:19:49,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:19:49,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:19:49,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:49,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:19:49,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:19:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-26 21:19:49,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:19:49,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:19:49,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:19:49,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:19:49,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:19:49,958 INFO L87 Difference]: Start difference. First operand 25631 states and 29966 transitions. Second operand 4 states. [2018-10-26 21:19:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:19:58,270 INFO L93 Difference]: Finished difference Result 87356 states and 102501 transitions. [2018-10-26 21:19:58,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:19:58,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 362 [2018-10-26 21:19:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:19:58,339 INFO L225 Difference]: With dead ends: 87356 [2018-10-26 21:19:58,340 INFO L226 Difference]: Without dead ends: 59459 [2018-10-26 21:19:58,367 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 21:19:58,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59459 states. [2018-10-26 21:19:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59459 to 54947. [2018-10-26 21:19:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54947 states. [2018-10-26 21:19:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54947 states to 54947 states and 61557 transitions. [2018-10-26 21:19:59,084 INFO L78 Accepts]: Start accepts. Automaton has 54947 states and 61557 transitions. Word has length 362 [2018-10-26 21:19:59,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:19:59,084 INFO L481 AbstractCegarLoop]: Abstraction has 54947 states and 61557 transitions. [2018-10-26 21:19:59,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:19:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 54947 states and 61557 transitions. [2018-10-26 21:19:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-26 21:19:59,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:19:59,108 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:19:59,109 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:19:59,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:19:59,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1894606626, now seen corresponding path program 1 times [2018-10-26 21:19:59,109 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:19:59,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:19:59,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:59,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:19:59,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:19:59,771 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-26 21:20:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 21:20:00,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:20:00,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:20:00,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:20:00,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:20:00,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:20:00,291 INFO L87 Difference]: Start difference. First operand 54947 states and 61557 transitions. Second operand 4 states. [2018-10-26 21:20:08,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:20:08,234 INFO L93 Difference]: Finished difference Result 134708 states and 150803 transitions. [2018-10-26 21:20:08,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:20:08,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 466 [2018-10-26 21:20:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:20:08,321 INFO L225 Difference]: With dead ends: 134708 [2018-10-26 21:20:08,321 INFO L226 Difference]: Without dead ends: 80515 [2018-10-26 21:20:08,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:20:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80515 states. [2018-10-26 21:20:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80515 to 79011. [2018-10-26 21:20:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79011 states. [2018-10-26 21:20:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79011 states to 79011 states and 87860 transitions. [2018-10-26 21:20:09,265 INFO L78 Accepts]: Start accepts. Automaton has 79011 states and 87860 transitions. Word has length 466 [2018-10-26 21:20:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:20:09,265 INFO L481 AbstractCegarLoop]: Abstraction has 79011 states and 87860 transitions. [2018-10-26 21:20:09,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:20:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 79011 states and 87860 transitions. [2018-10-26 21:20:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-10-26 21:20:09,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:20:09,289 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:20:09,289 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:20:09,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:20:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1065961236, now seen corresponding path program 1 times [2018-10-26 21:20:09,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:20:09,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:20:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:09,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:20:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:20:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-26 21:20:10,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:20:10,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:20:10,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:20:10,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:20:10,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:20:10,441 INFO L87 Difference]: Start difference. First operand 79011 states and 87860 transitions. Second operand 5 states. [2018-10-26 21:20:23,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:20:23,401 INFO L93 Difference]: Finished difference Result 231000 states and 256955 transitions. [2018-10-26 21:20:23,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:20:23,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 470 [2018-10-26 21:20:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:20:23,570 INFO L225 Difference]: With dead ends: 231000 [2018-10-26 21:20:23,570 INFO L226 Difference]: Without dead ends: 152743 [2018-10-26 21:20:23,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:20:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152743 states. [2018-10-26 21:20:25,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152743 to 114391. [2018-10-26 21:20:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114391 states. [2018-10-26 21:20:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114391 states to 114391 states and 123457 transitions. [2018-10-26 21:20:25,475 INFO L78 Accepts]: Start accepts. Automaton has 114391 states and 123457 transitions. Word has length 470 [2018-10-26 21:20:25,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:20:25,476 INFO L481 AbstractCegarLoop]: Abstraction has 114391 states and 123457 transitions. [2018-10-26 21:20:25,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:20:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 114391 states and 123457 transitions. [2018-10-26 21:20:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 991 [2018-10-26 21:20:25,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:20:25,658 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:25,659 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:20:25,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:20:25,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1428436794, now seen corresponding path program 1 times [2018-10-26 21:20:25,659 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:20:25,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:20:25,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:25,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:20:25,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:20:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 452 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-26 21:20:27,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:20:27,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:20:27,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:20:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:20:27,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:20:27,723 INFO L87 Difference]: Start difference. First operand 114391 states and 123457 transitions. Second operand 4 states. [2018-10-26 21:20:34,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:20:34,965 INFO L93 Difference]: Finished difference Result 227276 states and 245332 transitions. [2018-10-26 21:20:34,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:20:34,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 990 [2018-10-26 21:20:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:20:35,084 INFO L225 Difference]: With dead ends: 227276 [2018-10-26 21:20:35,084 INFO L226 Difference]: Without dead ends: 92528 [2018-10-26 21:20:35,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 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 21:20:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92528 states. [2018-10-26 21:20:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92528 to 89520. [2018-10-26 21:20:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89520 states. [2018-10-26 21:20:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89520 states to 89520 states and 94426 transitions. [2018-10-26 21:20:36,256 INFO L78 Accepts]: Start accepts. Automaton has 89520 states and 94426 transitions. Word has length 990 [2018-10-26 21:20:36,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:20:36,262 INFO L481 AbstractCegarLoop]: Abstraction has 89520 states and 94426 transitions. [2018-10-26 21:20:36,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:20:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 89520 states and 94426 transitions. [2018-10-26 21:20:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1020 [2018-10-26 21:20:36,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:20:36,339 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:36,339 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:20:36,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:20:36,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1686038366, now seen corresponding path program 1 times [2018-10-26 21:20:36,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:20:36,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:20:36,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:36,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:20:36,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:20:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-10-26 21:20:37,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:20:37,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:20:37,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:20:37,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:20:37,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:20:37,975 INFO L87 Difference]: Start difference. First operand 89520 states and 94426 transitions. Second operand 3 states. [2018-10-26 21:20:46,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:20:46,347 INFO L93 Difference]: Finished difference Result 221902 states and 234786 transitions. [2018-10-26 21:20:46,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:20:46,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1019 [2018-10-26 21:20:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:20:46,469 INFO L225 Difference]: With dead ends: 221902 [2018-10-26 21:20:46,470 INFO L226 Difference]: Without dead ends: 132383 [2018-10-26 21:20:46,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:20:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132383 states. [2018-10-26 21:20:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132383 to 120351. [2018-10-26 21:20:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120351 states. [2018-10-26 21:20:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120351 states to 120351 states and 126128 transitions. [2018-10-26 21:20:47,464 INFO L78 Accepts]: Start accepts. Automaton has 120351 states and 126128 transitions. Word has length 1019 [2018-10-26 21:20:47,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:20:47,465 INFO L481 AbstractCegarLoop]: Abstraction has 120351 states and 126128 transitions. [2018-10-26 21:20:47,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:20:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 120351 states and 126128 transitions. [2018-10-26 21:20:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1028 [2018-10-26 21:20:47,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:20:47,539 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:47,539 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:20:47,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:20:47,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1518124272, now seen corresponding path program 1 times [2018-10-26 21:20:47,540 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:20:47,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:20:47,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:47,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:20:47,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:20:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-26 21:20:48,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:20:48,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:20:48,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:20:48,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:20:48,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:20:48,971 INFO L87 Difference]: Start difference. First operand 120351 states and 126128 transitions. Second operand 4 states. [2018-10-26 21:20:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:20:58,408 INFO L93 Difference]: Finished difference Result 268524 states and 280933 transitions. [2018-10-26 21:20:58,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:20:58,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1027 [2018-10-26 21:20:58,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:20:58,562 INFO L225 Difference]: With dead ends: 268524 [2018-10-26 21:20:58,562 INFO L226 Difference]: Without dead ends: 148927 [2018-10-26 21:20:58,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 21:20:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148927 states. [2018-10-26 21:21:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148927 to 137647. [2018-10-26 21:21:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137647 states. [2018-10-26 21:21:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137647 states to 137647 states and 143348 transitions. [2018-10-26 21:21:00,508 INFO L78 Accepts]: Start accepts. Automaton has 137647 states and 143348 transitions. Word has length 1027 [2018-10-26 21:21:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:21:00,509 INFO L481 AbstractCegarLoop]: Abstraction has 137647 states and 143348 transitions. [2018-10-26 21:21:00,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:21:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 137647 states and 143348 transitions. [2018-10-26 21:21:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1074 [2018-10-26 21:21:00,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:21:00,575 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:00,576 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:21:00,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:21:00,576 INFO L82 PathProgramCache]: Analyzing trace with hash 503842909, now seen corresponding path program 1 times [2018-10-26 21:21:00,576 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:21:00,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:21:00,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:21:00,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:21:00,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:21:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:21:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-10-26 21:21:02,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:21:02,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:21:02,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:21:02,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:21:02,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:21:02,750 INFO L87 Difference]: Start difference. First operand 137647 states and 143348 transitions. Second operand 4 states. [2018-10-26 21:21:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:21:09,603 INFO L93 Difference]: Finished difference Result 276044 states and 287449 transitions. [2018-10-26 21:21:09,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:21:09,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1073 [2018-10-26 21:21:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:21:09,748 INFO L225 Difference]: With dead ends: 276044 [2018-10-26 21:21:09,749 INFO L226 Difference]: Without dead ends: 139151 [2018-10-26 21:21:09,791 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 21:21:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139151 states. [2018-10-26 21:21:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139151 to 135391. [2018-10-26 21:21:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135391 states. [2018-10-26 21:21:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135391 states to 135391 states and 139618 transitions. [2018-10-26 21:21:10,850 INFO L78 Accepts]: Start accepts. Automaton has 135391 states and 139618 transitions. Word has length 1073 [2018-10-26 21:21:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:21:10,850 INFO L481 AbstractCegarLoop]: Abstraction has 135391 states and 139618 transitions. [2018-10-26 21:21:10,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:21:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 135391 states and 139618 transitions. [2018-10-26 21:21:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1158 [2018-10-26 21:21:10,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:21:10,915 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:10,915 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:21:10,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:21:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1300886854, now seen corresponding path program 1 times [2018-10-26 21:21:10,916 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:21:10,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:21:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:21:10,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:21:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:21:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:21:12,111 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-26 21:21:12,652 WARN L179 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-10-26 21:21:12,998 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2018-10-26 21:21:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 619 proven. 30 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-10-26 21:21:17,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:21:17,752 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:21:17,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:21:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:21:18,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:21:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 619 proven. 30 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-10-26 21:21:19,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:21:19,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4] total 13 [2018-10-26 21:21:19,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 21:21:19,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 21:21:19,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:21:19,399 INFO L87 Difference]: Start difference. First operand 135391 states and 139618 transitions. Second operand 13 states. Received shutdown request... [2018-10-26 21:22:09,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-26 21:22:09,669 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 21:22:09,674 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 21:22:09,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:22:09 BoogieIcfgContainer [2018-10-26 21:22:09,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:22:09,675 INFO L168 Benchmark]: Toolchain (without parser) took 231212.32 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 837.8 MB. Max. memory is 7.1 GB. [2018-10-26 21:22:09,676 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 21:22:09,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2036.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-26 21:22:09,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 684.16 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 823.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:22:09,679 INFO L168 Benchmark]: Boogie Preprocessor took 335.11 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. [2018-10-26 21:22:09,680 INFO L168 Benchmark]: RCFGBuilder took 8464.14 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 235.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -236.1 MB). Peak memory consumption was 658.3 MB. Max. memory is 7.1 GB. [2018-10-26 21:22:09,681 INFO L168 Benchmark]: TraceAbstraction took 219686.97 ms. Allocated memory was 2.6 GB in the beginning and 3.5 GB in the end (delta: 857.2 MB). Free memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: -90.8 MB). Peak memory consumption was 766.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:22:09,689 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 2036.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 684.16 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 823.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 335.11 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8464.14 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 235.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -236.1 MB). Peak memory consumption was 658.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 219686.97 ms. Allocated memory was 2.6 GB in the beginning and 3.5 GB in the end (delta: 857.2 MB). Free memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: -90.8 MB). Peak memory consumption was 766.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 105). Cancelled while BasicCegarLoop was constructing difference of abstraction (135391states) and FLOYD_HOARE automaton (currently 29 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (278019 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. TIMEOUT Result, 219.5s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 186.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9213 SDtfs, 32575 SDslu, 1422 SDs, 0 SdLazy, 90224 SolverSat, 13407 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 155.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1451 GetRequests, 1370 SyntacticMatches, 18 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137647occurred in iteration=12, 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: 10.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 85774 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 8933 NumberOfCodeBlocks, 8933 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 8917 ConstructedInterpolants, 32 QuantifiedInterpolants, 32971001 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1623 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 7638/7703 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown