java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:03:52,604 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:03:52,606 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:03:52,617 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:03:52,618 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:03:52,619 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:03:52,620 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:03:52,622 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:03:52,623 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:03:52,624 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:03:52,625 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:03:52,626 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:03:52,627 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:03:52,628 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:03:52,629 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:03:52,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:03:52,630 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:03:52,632 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:03:52,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:03:52,639 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:03:52,640 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:03:52,641 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:03:52,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:03:52,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:03:52,647 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:03:52,647 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:03:52,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:03:52,651 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:03:52,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:03:52,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:03:52,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:03:52,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:03:52,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:03:52,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:03:52,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:03:52,662 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:03:52,662 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-02 12:03:52,683 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:03:52,683 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:03:52,684 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:03:52,684 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:03:52,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:03:52,685 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:03:52,686 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:03:52,686 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:03:52,686 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:03:52,686 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:03:52,686 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:03:52,686 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:03:52,687 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:03:52,687 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:03:52,687 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:03:52,687 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:03:52,687 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:03:52,688 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:03:52,688 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:03:52,688 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:03:52,688 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:03:52,688 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:03:52,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:03:52,689 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:03:52,689 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:03:52,690 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:03:52,690 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:03:52,691 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:03:52,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:03:52,691 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:03:52,691 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:03:52,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:03:52,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:03:52,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:03:52,791 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:03:52,791 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:03:52,792 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-10-02 12:03:52,792 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-10-02 12:03:52,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:03:52,853 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:03:52,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:03:52,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:03:52,854 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:03:52,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:52" (1/1) ... [2018-10-02 12:03:52,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:52" (1/1) ... [2018-10-02 12:03:52,894 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 12:03:52,894 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 12:03:52,895 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 12:03:52,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:03:52,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:03:52,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:03:52,898 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:03:52,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:52" (1/1) ... [2018-10-02 12:03:52,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:52" (1/1) ... [2018-10-02 12:03:52,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:52" (1/1) ... [2018-10-02 12:03:52,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:52" (1/1) ... [2018-10-02 12:03:52,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:52" (1/1) ... [2018-10-02 12:03:52,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:52" (1/1) ... [2018-10-02 12:03:52,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:52" (1/1) ... [2018-10-02 12:03:52,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:03:52,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:03:52,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:03:52,922 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:03:52,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-02 12:03:52,998 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-02 12:03:52,998 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-02 12:03:52,998 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-02 12:03:53,422 INFO L337 CfgBuilder]: Using library mode [2018-10-02 12:03:53,423 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:53 BoogieIcfgContainer [2018-10-02 12:03:53,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:03:53,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:03:53,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:03:53,428 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:03:53,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:52" (1/2) ... [2018-10-02 12:03:53,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7094b795 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:03:53, skipping insertion in model container [2018-10-02 12:03:53,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:53" (2/2) ... [2018-10-02 12:03:53,431 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-10-02 12:03:53,441 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:03:53,451 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-02 12:03:53,502 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:03:53,503 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:03:53,503 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:03:53,503 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:03:53,503 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:03:53,504 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:03:53,504 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:03:53,504 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:03:53,504 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:03:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-02 12:03:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 12:03:53,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:53,528 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-02 12:03:53,529 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:53,536 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:53,536 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-10-02 12:03:53,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:53,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:53,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:53,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:53,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:53,772 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-02 12:03:53,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:53,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:53,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:03:53,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:03:53,794 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:53,795 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-10-02 12:03:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:55,333 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-10-02 12:03:55,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 12:03:55,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-02 12:03:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:55,350 INFO L225 Difference]: With dead ends: 32 [2018-10-02 12:03:55,350 INFO L226 Difference]: Without dead ends: 30 [2018-10-02 12:03:55,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:03:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-02 12:03:55,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-10-02 12:03:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-02 12:03:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-10-02 12:03:55,389 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-10-02 12:03:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:55,390 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-10-02 12:03:55,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:03:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-10-02 12:03:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 12:03:55,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:55,391 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-02 12:03:55,392 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:55,392 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:55,392 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-10-02 12:03:55,393 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:55,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:55,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:55,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:55,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:55,454 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-02 12:03:55,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:55,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:55,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:03:55,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:03:55,457 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:55,457 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-10-02 12:03:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:56,063 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-10-02 12:03:56,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 12:03:56,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-02 12:03:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:56,065 INFO L225 Difference]: With dead ends: 38 [2018-10-02 12:03:56,066 INFO L226 Difference]: Without dead ends: 36 [2018-10-02 12:03:56,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:03:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-02 12:03:56,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-10-02 12:03:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-02 12:03:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-10-02 12:03:56,075 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-10-02 12:03:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:56,075 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-10-02 12:03:56,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:03:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-10-02 12:03:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 12:03:56,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:56,076 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 12:03:56,077 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:56,077 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:56,077 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-10-02 12:03:56,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:56,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:56,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:56,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:56,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:56,174 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-02 12:03:56,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:56,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:03:56,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 12:03:56,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 12:03:56,177 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:56,177 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-10-02 12:03:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:57,270 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-10-02 12:03:57,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 12:03:57,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-02 12:03:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:57,280 INFO L225 Difference]: With dead ends: 43 [2018-10-02 12:03:57,280 INFO L226 Difference]: Without dead ends: 41 [2018-10-02 12:03:57,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:03:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-02 12:03:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-10-02 12:03:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-02 12:03:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-10-02 12:03:57,297 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-10-02 12:03:57,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:57,299 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-10-02 12:03:57,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 12:03:57,299 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-10-02 12:03:57,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 12:03:57,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:57,300 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 12:03:57,301 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:57,301 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:57,301 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-10-02 12:03:57,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:57,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:57,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:57,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:57,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:57,400 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-02 12:03:57,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:57,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:03:57,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 12:03:57,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 12:03:57,402 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:57,402 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-10-02 12:03:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:58,124 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-10-02 12:03:58,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 12:03:58,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-02 12:03:58,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:58,128 INFO L225 Difference]: With dead ends: 54 [2018-10-02 12:03:58,129 INFO L226 Difference]: Without dead ends: 52 [2018-10-02 12:03:58,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:03:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-02 12:03:58,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-10-02 12:03:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-02 12:03:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-10-02 12:03:58,141 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-10-02 12:03:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:58,141 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-10-02 12:03:58,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 12:03:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-10-02 12:03:58,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:03:58,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:58,143 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:58,143 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:58,144 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:58,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-10-02 12:03:58,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:58,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:58,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:58,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:58,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:58,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:58,238 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-02 12:03:58,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:58,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:58,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:03:58,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 12:03:58,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:03:58,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:03:58,492 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:58,492 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 14 states. [2018-10-02 12:04:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:01,150 INFO L93 Difference]: Finished difference Result 107 states and 168 transitions. [2018-10-02 12:04:01,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 12:04:01,151 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-10-02 12:04:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:01,154 INFO L225 Difference]: With dead ends: 107 [2018-10-02 12:04:01,154 INFO L226 Difference]: Without dead ends: 106 [2018-10-02 12:04:01,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime [2018-10-02 12:04:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-02 12:04:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-10-02 12:04:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-02 12:04:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-10-02 12:04:01,168 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-10-02 12:04:01,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:01,168 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2018-10-02 12:04:01,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:04:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2018-10-02 12:04:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:01,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:01,169 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:01,170 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:01,170 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:01,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-10-02 12:04:01,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:01,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:01,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:01,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:01,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:01,280 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-02 12:04:01,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:01,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:04:01,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:01,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:01,282 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:01,282 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand 8 states. [2018-10-02 12:04:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:02,365 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2018-10-02 12:04:02,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:04:02,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:04:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:02,367 INFO L225 Difference]: With dead ends: 95 [2018-10-02 12:04:02,367 INFO L226 Difference]: Without dead ends: 93 [2018-10-02 12:04:02,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime [2018-10-02 12:04:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-02 12:04:02,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-10-02 12:04:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-02 12:04:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 134 transitions. [2018-10-02 12:04:02,384 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 134 transitions. Word has length 8 [2018-10-02 12:04:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:02,384 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 134 transitions. [2018-10-02 12:04:02,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 134 transitions. [2018-10-02 12:04:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:02,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:02,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:02,386 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:02,386 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:02,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-10-02 12:04:02,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:02,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:02,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:02,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:02,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:02,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:02,482 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-02 12:04:02,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:02,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:02,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:02,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:02,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-02 12:04:02,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:02,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:02,844 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:02,845 INFO L87 Difference]: Start difference. First operand 77 states and 134 transitions. Second operand 13 states. [2018-10-02 12:04:07,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:07,336 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2018-10-02 12:04:07,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:04:07,342 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-02 12:04:07,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:07,344 INFO L225 Difference]: With dead ends: 150 [2018-10-02 12:04:07,344 INFO L226 Difference]: Without dead ends: 148 [2018-10-02 12:04:07,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.8s impTime [2018-10-02 12:04:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-02 12:04:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2018-10-02 12:04:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-02 12:04:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-10-02 12:04:07,367 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 8 [2018-10-02 12:04:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:07,368 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 185 transitions. [2018-10-02 12:04:07,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 185 transitions. [2018-10-02 12:04:07,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:07,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:07,369 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:07,369 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:07,370 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:07,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-10-02 12:04:07,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:07,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:07,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:07,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:07,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:07,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:07,605 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:07,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:07,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:07,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:07,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-10-02 12:04:07,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:07,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:07,795 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:07,795 INFO L87 Difference]: Start difference. First operand 106 states and 185 transitions. Second operand 13 states. [2018-10-02 12:04:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:10,068 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-10-02 12:04:10,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:04:10,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-02 12:04:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:10,071 INFO L225 Difference]: With dead ends: 137 [2018-10-02 12:04:10,071 INFO L226 Difference]: Without dead ends: 135 [2018-10-02 12:04:10,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:04:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-02 12:04:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-10-02 12:04:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-02 12:04:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-10-02 12:04:10,092 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-10-02 12:04:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:10,093 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-10-02 12:04:10,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-10-02 12:04:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:10,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:10,094 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:10,094 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:10,095 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:10,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-10-02 12:04:10,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:10,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:10,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:10,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:10,316 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:10,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:10,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:10,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:10,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2018-10-02 12:04:10,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:10,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:10,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:10,412 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 13 states. [2018-10-02 12:04:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:13,628 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2018-10-02 12:04:13,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:04:13,629 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-02 12:04:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:13,630 INFO L225 Difference]: With dead ends: 211 [2018-10-02 12:04:13,631 INFO L226 Difference]: Without dead ends: 209 [2018-10-02 12:04:13,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime [2018-10-02 12:04:13,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-02 12:04:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 173. [2018-10-02 12:04:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-02 12:04:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 304 transitions. [2018-10-02 12:04:13,664 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 304 transitions. Word has length 8 [2018-10-02 12:04:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:13,664 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 304 transitions. [2018-10-02 12:04:13,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2018-10-02 12:04:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:13,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:13,666 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:13,666 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:13,666 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:13,667 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-10-02 12:04:13,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:13,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:13,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:13,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:13,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:13,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:13,741 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:13,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:13,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:13,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:13,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-02 12:04:13,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 12:04:13,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 12:04:13,835 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:13,835 INFO L87 Difference]: Start difference. First operand 173 states and 304 transitions. Second operand 11 states. [2018-10-02 12:04:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:15,546 INFO L93 Difference]: Finished difference Result 246 states and 415 transitions. [2018-10-02 12:04:15,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:04:15,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-10-02 12:04:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:15,555 INFO L225 Difference]: With dead ends: 246 [2018-10-02 12:04:15,556 INFO L226 Difference]: Without dead ends: 245 [2018-10-02 12:04:15,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime [2018-10-02 12:04:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-02 12:04:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2018-10-02 12:04:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-02 12:04:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 358 transitions. [2018-10-02 12:04:15,593 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 358 transitions. Word has length 8 [2018-10-02 12:04:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:15,593 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 358 transitions. [2018-10-02 12:04:15,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 12:04:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 358 transitions. [2018-10-02 12:04:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:15,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:15,594 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:15,595 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:15,595 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-10-02 12:04:15,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:15,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:15,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:15,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:15,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:15,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:15,733 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:15,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:15,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:15,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:15,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-02 12:04:15,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:04:15,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:04:15,816 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:15,816 INFO L87 Difference]: Start difference. First operand 201 states and 358 transitions. Second operand 7 states. [2018-10-02 12:04:16,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:16,548 INFO L93 Difference]: Finished difference Result 252 states and 436 transitions. [2018-10-02 12:04:16,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 12:04:16,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:04:16,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:16,550 INFO L225 Difference]: With dead ends: 252 [2018-10-02 12:04:16,550 INFO L226 Difference]: Without dead ends: 250 [2018-10-02 12:04:16,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:04:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-02 12:04:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2018-10-02 12:04:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-02 12:04:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 375 transitions. [2018-10-02 12:04:16,584 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 375 transitions. Word has length 8 [2018-10-02 12:04:16,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:16,584 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 375 transitions. [2018-10-02 12:04:16,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:04:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 375 transitions. [2018-10-02 12:04:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:16,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:16,585 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:16,585 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:16,585 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:16,586 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-10-02 12:04:16,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:16,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:16,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:16,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:16,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:16,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:16,658 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:16,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:16,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:17,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:17,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-02 12:04:17,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 12:04:17,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 12:04:17,001 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:17,001 INFO L87 Difference]: Start difference. First operand 210 states and 375 transitions. Second operand 10 states. [2018-10-02 12:04:18,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:18,350 INFO L93 Difference]: Finished difference Result 260 states and 452 transitions. [2018-10-02 12:04:18,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:04:18,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-10-02 12:04:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:18,356 INFO L225 Difference]: With dead ends: 260 [2018-10-02 12:04:18,356 INFO L226 Difference]: Without dead ends: 259 [2018-10-02 12:04:18,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:04:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-02 12:04:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 229. [2018-10-02 12:04:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-02 12:04:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 409 transitions. [2018-10-02 12:04:18,395 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 409 transitions. Word has length 8 [2018-10-02 12:04:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:18,395 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 409 transitions. [2018-10-02 12:04:18,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 12:04:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 409 transitions. [2018-10-02 12:04:18,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:18,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:18,397 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:18,397 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:18,397 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:18,397 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-10-02 12:04:18,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:18,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:18,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:18,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:18,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:18,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:18,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:04:18,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:04:18,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:04:18,477 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:18,477 INFO L87 Difference]: Start difference. First operand 229 states and 409 transitions. Second operand 7 states. [2018-10-02 12:04:19,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:19,604 INFO L93 Difference]: Finished difference Result 316 states and 557 transitions. [2018-10-02 12:04:19,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:04:19,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:04:19,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:19,606 INFO L225 Difference]: With dead ends: 316 [2018-10-02 12:04:19,606 INFO L226 Difference]: Without dead ends: 314 [2018-10-02 12:04:19,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:04:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-02 12:04:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-10-02 12:04:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-02 12:04:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 438 transitions. [2018-10-02 12:04:19,653 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 438 transitions. Word has length 8 [2018-10-02 12:04:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:19,654 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 438 transitions. [2018-10-02 12:04:19,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:04:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 438 transitions. [2018-10-02 12:04:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:19,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:19,655 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:19,655 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:19,655 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:19,655 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-10-02 12:04:19,655 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:19,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:19,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:19,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:19,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:19,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:19,733 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-02 12:04:19,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:19,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:19,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:19,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-02 12:04:19,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:04:19,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:04:19,817 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:19,817 INFO L87 Difference]: Start difference. First operand 245 states and 438 transitions. Second operand 7 states. [2018-10-02 12:04:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:20,547 INFO L93 Difference]: Finished difference Result 428 states and 767 transitions. [2018-10-02 12:04:20,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 12:04:20,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:04:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:20,555 INFO L225 Difference]: With dead ends: 428 [2018-10-02 12:04:20,555 INFO L226 Difference]: Without dead ends: 426 [2018-10-02 12:04:20,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:04:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-02 12:04:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 345. [2018-10-02 12:04:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-02 12:04:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 622 transitions. [2018-10-02 12:04:20,625 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 622 transitions. Word has length 8 [2018-10-02 12:04:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:20,625 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 622 transitions. [2018-10-02 12:04:20,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:04:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 622 transitions. [2018-10-02 12:04:20,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:04:20,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:20,627 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:20,627 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:20,627 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:20,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-10-02 12:04:20,628 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:20,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:20,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:20,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:20,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:20,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:20,871 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:20,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:20,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:20,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:20,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-02 12:04:20,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 12:04:20,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 12:04:20,964 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:20,964 INFO L87 Difference]: Start difference. First operand 345 states and 622 transitions. Second operand 10 states. [2018-10-02 12:04:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:23,701 INFO L93 Difference]: Finished difference Result 466 states and 826 transitions. [2018-10-02 12:04:23,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:04:23,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-02 12:04:23,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:23,704 INFO L225 Difference]: With dead ends: 466 [2018-10-02 12:04:23,704 INFO L226 Difference]: Without dead ends: 464 [2018-10-02 12:04:23,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:04:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-02 12:04:23,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 351. [2018-10-02 12:04:23,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-02 12:04:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 634 transitions. [2018-10-02 12:04:23,772 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 634 transitions. Word has length 11 [2018-10-02 12:04:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:23,772 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 634 transitions. [2018-10-02 12:04:23,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 12:04:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 634 transitions. [2018-10-02 12:04:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:04:23,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:23,773 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:23,774 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:23,774 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:23,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-10-02 12:04:23,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:23,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:23,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:23,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:23,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:23,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:23,871 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:23,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:23,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:23,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:04:23,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-10-02 12:04:23,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:23,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:23,999 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:23,999 INFO L87 Difference]: Start difference. First operand 351 states and 634 transitions. Second operand 14 states. [2018-10-02 12:04:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:27,902 INFO L93 Difference]: Finished difference Result 859 states and 1521 transitions. [2018-10-02 12:04:27,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-02 12:04:27,903 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-10-02 12:04:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:27,906 INFO L225 Difference]: With dead ends: 859 [2018-10-02 12:04:27,906 INFO L226 Difference]: Without dead ends: 509 [2018-10-02 12:04:27,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime [2018-10-02 12:04:27,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-10-02 12:04:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 388. [2018-10-02 12:04:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-02 12:04:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 697 transitions. [2018-10-02 12:04:28,032 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 697 transitions. Word has length 11 [2018-10-02 12:04:28,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:28,033 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 697 transitions. [2018-10-02 12:04:28,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:04:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 697 transitions. [2018-10-02 12:04:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:04:28,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:28,034 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:28,034 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:28,035 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-10-02 12:04:28,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:28,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:28,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:28,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:28,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:28,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:28,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:04:28,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:28,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:28,506 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:28,507 INFO L87 Difference]: Start difference. First operand 388 states and 697 transitions. Second operand 8 states. [2018-10-02 12:04:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:29,753 INFO L93 Difference]: Finished difference Result 481 states and 848 transitions. [2018-10-02 12:04:29,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 12:04:29,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-02 12:04:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:29,756 INFO L225 Difference]: With dead ends: 481 [2018-10-02 12:04:29,756 INFO L226 Difference]: Without dead ends: 479 [2018-10-02 12:04:29,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:04:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-02 12:04:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 394. [2018-10-02 12:04:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-02 12:04:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 703 transitions. [2018-10-02 12:04:29,847 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 703 transitions. Word has length 11 [2018-10-02 12:04:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:29,847 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 703 transitions. [2018-10-02 12:04:29,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 703 transitions. [2018-10-02 12:04:29,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:04:29,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:29,848 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:29,849 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:29,849 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:29,849 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-10-02 12:04:29,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:29,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:29,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:29,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:29,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:30,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:30,006 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:30,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:30,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:30,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:30,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-02 12:04:30,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:30,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:30,216 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:30,216 INFO L87 Difference]: Start difference. First operand 394 states and 703 transitions. Second operand 13 states. [2018-10-02 12:04:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:32,852 INFO L93 Difference]: Finished difference Result 952 states and 1676 transitions. [2018-10-02 12:04:32,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:04:32,852 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-02 12:04:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:32,855 INFO L225 Difference]: With dead ends: 952 [2018-10-02 12:04:32,855 INFO L226 Difference]: Without dead ends: 559 [2018-10-02 12:04:32,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime [2018-10-02 12:04:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-02 12:04:32,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 473. [2018-10-02 12:04:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-10-02 12:04:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 835 transitions. [2018-10-02 12:04:32,951 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 835 transitions. Word has length 11 [2018-10-02 12:04:32,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:32,952 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 835 transitions. [2018-10-02 12:04:32,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 835 transitions. [2018-10-02 12:04:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:04:32,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:32,953 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:32,953 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:32,953 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:32,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-10-02 12:04:32,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:32,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:32,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:32,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:32,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:33,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:33,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:04:33,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:33,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:33,053 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:33,053 INFO L87 Difference]: Start difference. First operand 473 states and 835 transitions. Second operand 8 states. [2018-10-02 12:04:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:34,125 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-10-02 12:04:34,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:04:34,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-02 12:04:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:34,128 INFO L225 Difference]: With dead ends: 524 [2018-10-02 12:04:34,128 INFO L226 Difference]: Without dead ends: 522 [2018-10-02 12:04:34,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:04:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-10-02 12:04:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 485. [2018-10-02 12:04:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-10-02 12:04:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 855 transitions. [2018-10-02 12:04:34,270 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 855 transitions. Word has length 11 [2018-10-02 12:04:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:34,270 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 855 transitions. [2018-10-02 12:04:34,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 855 transitions. [2018-10-02 12:04:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:04:34,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:34,271 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:34,271 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:34,272 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:34,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-10-02 12:04:34,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:34,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:34,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:34,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:34,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:34,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:34,604 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:34,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:34,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:34,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:34,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-10-02 12:04:34,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:04:34,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:04:34,672 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:34,672 INFO L87 Difference]: Start difference. First operand 485 states and 855 transitions. Second operand 9 states. [2018-10-02 12:04:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:36,973 INFO L93 Difference]: Finished difference Result 556 states and 964 transitions. [2018-10-02 12:04:36,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 12:04:36,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-10-02 12:04:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:36,978 INFO L225 Difference]: With dead ends: 556 [2018-10-02 12:04:36,978 INFO L226 Difference]: Without dead ends: 554 [2018-10-02 12:04:36,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime [2018-10-02 12:04:36,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-02 12:04:37,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 489. [2018-10-02 12:04:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-10-02 12:04:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 861 transitions. [2018-10-02 12:04:37,093 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 861 transitions. Word has length 11 [2018-10-02 12:04:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:37,094 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 861 transitions. [2018-10-02 12:04:37,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:04:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 861 transitions. [2018-10-02 12:04:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:04:37,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:37,095 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:37,095 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:37,095 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:37,095 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-10-02 12:04:37,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:37,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:37,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:37,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:37,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:37,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:37,207 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:37,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:37,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:37,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:37,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 12 [2018-10-02 12:04:37,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:37,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:37,322 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:37,322 INFO L87 Difference]: Start difference. First operand 489 states and 861 transitions. Second operand 13 states. [2018-10-02 12:04:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:40,783 INFO L93 Difference]: Finished difference Result 631 states and 1077 transitions. [2018-10-02 12:04:40,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:04:40,791 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-02 12:04:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:40,793 INFO L225 Difference]: With dead ends: 631 [2018-10-02 12:04:40,794 INFO L226 Difference]: Without dead ends: 629 [2018-10-02 12:04:40,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:04:40,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-02 12:04:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 513. [2018-10-02 12:04:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-02 12:04:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 904 transitions. [2018-10-02 12:04:40,913 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 904 transitions. Word has length 11 [2018-10-02 12:04:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:40,913 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 904 transitions. [2018-10-02 12:04:40,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 904 transitions. [2018-10-02 12:04:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:04:40,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:40,914 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:40,914 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:40,914 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-10-02 12:04:40,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:40,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:40,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:40,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:40,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:41,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:41,003 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:41,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:04:41,019 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:04:41,019 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:04:41,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:41,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:41,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 12:04:41,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:04:41,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:04:41,088 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:41,088 INFO L87 Difference]: Start difference. First operand 513 states and 904 transitions. Second operand 7 states. [2018-10-02 12:04:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:42,313 INFO L93 Difference]: Finished difference Result 601 states and 1040 transitions. [2018-10-02 12:04:42,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:04:42,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-02 12:04:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:42,319 INFO L225 Difference]: With dead ends: 601 [2018-10-02 12:04:42,319 INFO L226 Difference]: Without dead ends: 599 [2018-10-02 12:04:42,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:04:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-10-02 12:04:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 509. [2018-10-02 12:04:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-10-02 12:04:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 898 transitions. [2018-10-02 12:04:42,435 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 898 transitions. Word has length 11 [2018-10-02 12:04:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:42,435 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 898 transitions. [2018-10-02 12:04:42,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:04:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 898 transitions. [2018-10-02 12:04:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:04:42,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:42,436 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:42,436 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:42,437 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:42,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-10-02 12:04:42,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:42,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:42,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:04:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:42,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:42,582 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:42,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:42,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:42,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:42,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 12:04:42,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:04:42,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:04:42,642 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:42,642 INFO L87 Difference]: Start difference. First operand 509 states and 898 transitions. Second operand 7 states. [2018-10-02 12:04:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:44,159 INFO L93 Difference]: Finished difference Result 624 states and 1088 transitions. [2018-10-02 12:04:44,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:04:44,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-02 12:04:44,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:44,162 INFO L225 Difference]: With dead ends: 624 [2018-10-02 12:04:44,162 INFO L226 Difference]: Without dead ends: 622 [2018-10-02 12:04:44,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:04:44,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-10-02 12:04:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 538. [2018-10-02 12:04:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-10-02 12:04:44,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 949 transitions. [2018-10-02 12:04:44,267 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 949 transitions. Word has length 11 [2018-10-02 12:04:44,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:44,267 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 949 transitions. [2018-10-02 12:04:44,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:04:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 949 transitions. [2018-10-02 12:04:44,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:04:44,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:44,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:44,268 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:44,268 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:44,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-10-02 12:04:44,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:44,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:44,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:44,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:44,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:44,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:44,333 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:44,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:44,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:44,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:44,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 12:04:44,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:04:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:04:44,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:44,392 INFO L87 Difference]: Start difference. First operand 538 states and 949 transitions. Second operand 7 states. [2018-10-02 12:04:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:45,368 INFO L93 Difference]: Finished difference Result 584 states and 1012 transitions. [2018-10-02 12:04:45,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 12:04:45,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-02 12:04:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:45,370 INFO L225 Difference]: With dead ends: 584 [2018-10-02 12:04:45,370 INFO L226 Difference]: Without dead ends: 582 [2018-10-02 12:04:45,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:04:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-10-02 12:04:45,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 543. [2018-10-02 12:04:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-10-02 12:04:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 956 transitions. [2018-10-02 12:04:45,466 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 956 transitions. Word has length 11 [2018-10-02 12:04:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:45,466 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 956 transitions. [2018-10-02 12:04:45,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:04:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 956 transitions. [2018-10-02 12:04:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:04:45,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:45,467 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:45,467 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:45,467 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:45,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-10-02 12:04:45,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:45,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:45,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:45,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:45,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:45,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:45,594 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:45,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:45,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:45,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:45,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 12:04:45,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:04:45,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:04:45,655 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:45,656 INFO L87 Difference]: Start difference. First operand 543 states and 956 transitions. Second operand 7 states. [2018-10-02 12:04:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:46,921 INFO L93 Difference]: Finished difference Result 618 states and 1074 transitions. [2018-10-02 12:04:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:04:46,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-02 12:04:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:46,924 INFO L225 Difference]: With dead ends: 618 [2018-10-02 12:04:46,924 INFO L226 Difference]: Without dead ends: 616 [2018-10-02 12:04:46,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:04:46,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-10-02 12:04:47,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 529. [2018-10-02 12:04:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-02 12:04:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 929 transitions. [2018-10-02 12:04:47,029 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 929 transitions. Word has length 11 [2018-10-02 12:04:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:47,029 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 929 transitions. [2018-10-02 12:04:47,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:04:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 929 transitions. [2018-10-02 12:04:47,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:04:47,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:47,030 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:47,031 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:47,031 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:47,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-10-02 12:04:47,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:47,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:47,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:47,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:47,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:47,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:47,095 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:47,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:47,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:47,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:47,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 12:04:47,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:04:47,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:04:47,156 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:47,156 INFO L87 Difference]: Start difference. First operand 529 states and 929 transitions. Second operand 7 states. [2018-10-02 12:04:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:48,264 INFO L93 Difference]: Finished difference Result 613 states and 1066 transitions. [2018-10-02 12:04:48,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:04:48,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-02 12:04:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:48,267 INFO L225 Difference]: With dead ends: 613 [2018-10-02 12:04:48,267 INFO L226 Difference]: Without dead ends: 611 [2018-10-02 12:04:48,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:04:48,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-10-02 12:04:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 523. [2018-10-02 12:04:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-02 12:04:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 914 transitions. [2018-10-02 12:04:48,369 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 914 transitions. Word has length 11 [2018-10-02 12:04:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:48,369 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 914 transitions. [2018-10-02 12:04:48,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:04:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 914 transitions. [2018-10-02 12:04:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:04:48,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:48,370 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:48,371 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:48,371 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-10-02 12:04:48,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:48,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:48,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:48,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:48,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:48,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:48,702 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:48,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:48,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:48,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:48,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-10-02 12:04:48,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:48,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:48,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:48,876 INFO L87 Difference]: Start difference. First operand 523 states and 914 transitions. Second operand 14 states. [2018-10-02 12:04:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:52,168 INFO L93 Difference]: Finished difference Result 875 states and 1523 transitions. [2018-10-02 12:04:52,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:04:52,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 12 [2018-10-02 12:04:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:52,179 INFO L225 Difference]: With dead ends: 875 [2018-10-02 12:04:52,179 INFO L226 Difference]: Without dead ends: 873 [2018-10-02 12:04:52,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime [2018-10-02 12:04:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-10-02 12:04:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 651. [2018-10-02 12:04:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-10-02 12:04:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1146 transitions. [2018-10-02 12:04:52,305 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1146 transitions. Word has length 12 [2018-10-02 12:04:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:52,306 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 1146 transitions. [2018-10-02 12:04:52,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:04:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1146 transitions. [2018-10-02 12:04:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:04:52,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:52,307 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:52,307 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:52,307 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:52,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-10-02 12:04:52,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:52,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:52,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:52,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:52,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:52,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:52,398 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:52,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:52,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:52,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:52,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-10-02 12:04:52,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:52,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:52,501 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:52,501 INFO L87 Difference]: Start difference. First operand 651 states and 1146 transitions. Second operand 13 states. [2018-10-02 12:04:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:56,087 INFO L93 Difference]: Finished difference Result 1281 states and 2254 transitions. [2018-10-02 12:04:56,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 12:04:56,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-02 12:04:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:56,092 INFO L225 Difference]: With dead ends: 1281 [2018-10-02 12:04:56,092 INFO L226 Difference]: Without dead ends: 1279 [2018-10-02 12:04:56,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:04:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-10-02 12:04:56,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 923. [2018-10-02 12:04:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-02 12:04:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-10-02 12:04:56,286 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 12 [2018-10-02 12:04:56,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:56,286 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-10-02 12:04:56,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-10-02 12:04:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:04:56,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:56,287 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:56,288 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:56,288 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:56,288 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-10-02 12:04:56,288 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:56,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:56,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:56,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:56,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:56,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:56,371 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:56,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:56,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:56,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:56,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-02 12:04:56,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 12:04:56,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 12:04:56,466 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:56,467 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 11 states. [2018-10-02 12:04:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:58,331 INFO L93 Difference]: Finished difference Result 1054 states and 1838 transitions. [2018-10-02 12:04:58,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 12:04:58,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-10-02 12:04:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:58,335 INFO L225 Difference]: With dead ends: 1054 [2018-10-02 12:04:58,335 INFO L226 Difference]: Without dead ends: 1052 [2018-10-02 12:04:58,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:04:58,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-10-02 12:04:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 933. [2018-10-02 12:04:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-02 12:04:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1644 transitions. [2018-10-02 12:04:58,533 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1644 transitions. Word has length 14 [2018-10-02 12:04:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:58,534 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1644 transitions. [2018-10-02 12:04:58,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 12:04:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1644 transitions. [2018-10-02 12:04:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:04:58,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:58,535 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:58,535 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:58,535 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:58,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times [2018-10-02 12:04:58,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:58,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:58,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:58,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:58,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:58,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:58,788 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:58,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:04:58,803 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:04:58,803 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:04:58,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:58,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:58,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-10-02 12:04:58,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:58,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:58,997 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:58,997 INFO L87 Difference]: Start difference. First operand 933 states and 1644 transitions. Second operand 14 states. [2018-10-02 12:05:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:02,918 INFO L93 Difference]: Finished difference Result 1125 states and 1938 transitions. [2018-10-02 12:05:02,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:05:02,918 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-02 12:05:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:02,922 INFO L225 Difference]: With dead ends: 1125 [2018-10-02 12:05:02,922 INFO L226 Difference]: Without dead ends: 1123 [2018-10-02 12:05:02,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime [2018-10-02 12:05:02,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-10-02 12:05:03,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 923. [2018-10-02 12:05:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-02 12:05:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-10-02 12:05:03,118 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 14 [2018-10-02 12:05:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:03,118 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-10-02 12:05:03,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:05:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-10-02 12:05:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:05:03,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:03,119 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:03,120 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:03,120 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:03,120 INFO L82 PathProgramCache]: Analyzing trace with hash -213121378, now seen corresponding path program 1 times [2018-10-02 12:05:03,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:03,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:03,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:03,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:05:03,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:03,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:03,205 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:03,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:03,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:03,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:03,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-10-02 12:05:03,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:05:03,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:05:03,351 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:03,351 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 14 states. [2018-10-02 12:05:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:07,453 INFO L93 Difference]: Finished difference Result 1125 states and 1949 transitions. [2018-10-02 12:05:07,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 12:05:07,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-02 12:05:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:07,457 INFO L225 Difference]: With dead ends: 1125 [2018-10-02 12:05:07,457 INFO L226 Difference]: Without dead ends: 1123 [2018-10-02 12:05:07,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:05:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-10-02 12:05:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 919. [2018-10-02 12:05:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-10-02 12:05:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1620 transitions. [2018-10-02 12:05:07,664 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1620 transitions. Word has length 14 [2018-10-02 12:05:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:07,664 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1620 transitions. [2018-10-02 12:05:07,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:05:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1620 transitions. [2018-10-02 12:05:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:05:07,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:07,665 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:07,666 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:07,666 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:07,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-10-02 12:05:07,666 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:07,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:07,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:07,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:07,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:07,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:07,758 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:07,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:07,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:07,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:07,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-10-02 12:05:07,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 12:05:07,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 12:05:07,853 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:07,853 INFO L87 Difference]: Start difference. First operand 919 states and 1620 transitions. Second operand 12 states. [2018-10-02 12:05:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:10,296 INFO L93 Difference]: Finished difference Result 1117 states and 1948 transitions. [2018-10-02 12:05:10,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 12:05:10,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-10-02 12:05:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:10,301 INFO L225 Difference]: With dead ends: 1117 [2018-10-02 12:05:10,301 INFO L226 Difference]: Without dead ends: 1115 [2018-10-02 12:05:10,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:05:10,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-10-02 12:05:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 883. [2018-10-02 12:05:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-10-02 12:05:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1560 transitions. [2018-10-02 12:05:10,500 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1560 transitions. Word has length 14 [2018-10-02 12:05:10,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:10,500 INFO L480 AbstractCegarLoop]: Abstraction has 883 states and 1560 transitions. [2018-10-02 12:05:10,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 12:05:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1560 transitions. [2018-10-02 12:05:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:05:10,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:10,501 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:10,501 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:10,502 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-10-02 12:05:10,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:10,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:10,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:10,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:10,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:10,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:10,584 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:10,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:10,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:10,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:10,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-02 12:05:10,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 12:05:10,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 12:05:10,670 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:10,670 INFO L87 Difference]: Start difference. First operand 883 states and 1560 transitions. Second operand 11 states. [2018-10-02 12:05:12,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:12,451 INFO L93 Difference]: Finished difference Result 995 states and 1722 transitions. [2018-10-02 12:05:12,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 12:05:12,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-10-02 12:05:12,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:12,455 INFO L225 Difference]: With dead ends: 995 [2018-10-02 12:05:12,455 INFO L226 Difference]: Without dead ends: 993 [2018-10-02 12:05:12,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:05:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-10-02 12:05:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 877. [2018-10-02 12:05:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-10-02 12:05:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1548 transitions. [2018-10-02 12:05:12,657 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1548 transitions. Word has length 14 [2018-10-02 12:05:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:12,657 INFO L480 AbstractCegarLoop]: Abstraction has 877 states and 1548 transitions. [2018-10-02 12:05:12,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 12:05:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1548 transitions. [2018-10-02 12:05:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:05:12,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:12,659 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 12:05:12,659 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:12,659 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:12,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2018-10-02 12:05:12,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:12,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:12,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:12,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:12,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:13,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:13,425 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:13,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:13,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:13,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:13,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-02 12:05:13,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 12:05:13,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 12:05:13,611 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:13,611 INFO L87 Difference]: Start difference. First operand 877 states and 1548 transitions. Second operand 17 states. [2018-10-02 12:05:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:19,442 INFO L93 Difference]: Finished difference Result 2105 states and 3670 transitions. [2018-10-02 12:05:19,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-02 12:05:19,442 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-10-02 12:05:19,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:19,446 INFO L225 Difference]: With dead ends: 2105 [2018-10-02 12:05:19,446 INFO L226 Difference]: Without dead ends: 1229 [2018-10-02 12:05:19,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.1s impTime [2018-10-02 12:05:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-10-02 12:05:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1014. [2018-10-02 12:05:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-10-02 12:05:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1752 transitions. [2018-10-02 12:05:19,685 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1752 transitions. Word has length 15 [2018-10-02 12:05:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:19,686 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1752 transitions. [2018-10-02 12:05:19,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 12:05:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1752 transitions. [2018-10-02 12:05:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:05:19,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:19,687 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:19,687 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:19,687 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:19,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1084233543, now seen corresponding path program 1 times [2018-10-02 12:05:19,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:19,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:19,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:19,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:19,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:19,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:19,831 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:19,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:19,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:19,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:19,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-02 12:05:19,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:05:19,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:05:19,975 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:19,975 INFO L87 Difference]: Start difference. First operand 1014 states and 1752 transitions. Second operand 15 states. [2018-10-02 12:05:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:25,115 INFO L93 Difference]: Finished difference Result 2110 states and 3623 transitions. [2018-10-02 12:05:25,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-02 12:05:25,115 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-02 12:05:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:25,119 INFO L225 Difference]: With dead ends: 2110 [2018-10-02 12:05:25,119 INFO L226 Difference]: Without dead ends: 1097 [2018-10-02 12:05:25,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime [2018-10-02 12:05:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-02 12:05:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 951. [2018-10-02 12:05:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-10-02 12:05:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1643 transitions. [2018-10-02 12:05:25,356 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1643 transitions. Word has length 15 [2018-10-02 12:05:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:25,356 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1643 transitions. [2018-10-02 12:05:25,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:05:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1643 transitions. [2018-10-02 12:05:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:05:25,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:25,357 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:25,357 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:25,357 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:25,357 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-10-02 12:05:25,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:25,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:25,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:26,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:26,024 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:26,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:26,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:26,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:26,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-02 12:05:26,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:05:26,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:05:26,131 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:26,131 INFO L87 Difference]: Start difference. First operand 951 states and 1643 transitions. Second operand 15 states. [2018-10-02 12:05:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:31,988 INFO L93 Difference]: Finished difference Result 2832 states and 4780 transitions. [2018-10-02 12:05:31,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 12:05:31,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-02 12:05:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:31,994 INFO L225 Difference]: With dead ends: 2832 [2018-10-02 12:05:31,995 INFO L226 Difference]: Without dead ends: 1867 [2018-10-02 12:05:31,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime [2018-10-02 12:05:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2018-10-02 12:05:32,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1571. [2018-10-02 12:05:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2018-10-02 12:05:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2660 transitions. [2018-10-02 12:05:32,407 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2660 transitions. Word has length 15 [2018-10-02 12:05:32,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:32,407 INFO L480 AbstractCegarLoop]: Abstraction has 1571 states and 2660 transitions. [2018-10-02 12:05:32,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:05:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2660 transitions. [2018-10-02 12:05:32,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:05:32,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:32,408 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:32,409 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:32,409 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:32,409 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-10-02 12:05:32,409 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:32,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:32,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:32,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:32,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:32,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:32,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:32,518 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:32,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:32,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:05:32,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:32,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-02 12:05:32,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:05:32,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:05:32,616 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:32,616 INFO L87 Difference]: Start difference. First operand 1571 states and 2660 transitions. Second operand 15 states. [2018-10-02 12:05:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:41,549 INFO L93 Difference]: Finished difference Result 4461 states and 7467 transitions. [2018-10-02 12:05:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-02 12:05:41,549 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-02 12:05:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:41,578 INFO L225 Difference]: With dead ends: 4461 [2018-10-02 12:05:41,579 INFO L226 Difference]: Without dead ends: 2887 [2018-10-02 12:05:41,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime [2018-10-02 12:05:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-10-02 12:05:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2284. [2018-10-02 12:05:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2018-10-02 12:05:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3759 transitions. [2018-10-02 12:05:42,553 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3759 transitions. Word has length 15 [2018-10-02 12:05:42,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:42,553 INFO L480 AbstractCegarLoop]: Abstraction has 2284 states and 3759 transitions. [2018-10-02 12:05:42,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:05:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3759 transitions. [2018-10-02 12:05:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:05:42,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:42,555 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 12:05:42,555 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:42,555 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-10-02 12:05:42,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:42,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:42,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:42,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:42,674 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:42,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:42,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:42,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 12:05:42,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:42,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-10-02 12:05:42,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:05:42,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:05:42,858 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:42,858 INFO L87 Difference]: Start difference. First operand 2284 states and 3759 transitions. Second operand 16 states. [2018-10-02 12:05:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:51,027 INFO L93 Difference]: Finished difference Result 3903 states and 6372 transitions. [2018-10-02 12:05:51,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-02 12:05:51,027 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-02 12:05:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:51,042 INFO L225 Difference]: With dead ends: 3903 [2018-10-02 12:05:51,042 INFO L226 Difference]: Without dead ends: 3227 [2018-10-02 12:05:51,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.7s impTime [2018-10-02 12:05:51,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2018-10-02 12:05:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2428. [2018-10-02 12:05:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-10-02 12:05:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4065 transitions. [2018-10-02 12:05:51,735 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4065 transitions. Word has length 15 [2018-10-02 12:05:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:51,735 INFO L480 AbstractCegarLoop]: Abstraction has 2428 states and 4065 transitions. [2018-10-02 12:05:51,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:05:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4065 transitions. [2018-10-02 12:05:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:05:51,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:51,736 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:51,737 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:51,737 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1386290021, now seen corresponding path program 1 times [2018-10-02 12:05:51,737 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:51,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:51,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:51,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:51,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:52,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:52,175 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:52,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:52,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:52,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:52,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-02 12:05:52,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:05:52,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:05:52,292 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:52,292 INFO L87 Difference]: Start difference. First operand 2428 states and 4065 transitions. Second operand 15 states. [2018-10-02 12:05:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:58,093 INFO L93 Difference]: Finished difference Result 5427 states and 9046 transitions. [2018-10-02 12:05:58,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-02 12:05:58,093 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-02 12:05:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:58,097 INFO L225 Difference]: With dead ends: 5427 [2018-10-02 12:05:58,098 INFO L226 Difference]: Without dead ends: 2851 [2018-10-02 12:05:58,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime [2018-10-02 12:05:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2018-10-02 12:05:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2500. [2018-10-02 12:05:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2018-10-02 12:05:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 4177 transitions. [2018-10-02 12:05:58,778 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 4177 transitions. Word has length 15 [2018-10-02 12:05:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:58,779 INFO L480 AbstractCegarLoop]: Abstraction has 2500 states and 4177 transitions. [2018-10-02 12:05:58,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:05:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4177 transitions. [2018-10-02 12:05:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:05:58,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:58,780 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 12:05:58,780 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:58,780 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:58,780 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-10-02 12:05:58,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:58,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:58,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:58,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:58,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:58,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:58,888 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:58,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:58,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 12:05:58,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:58,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-02 12:05:58,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:05:58,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:05:58,994 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:58,994 INFO L87 Difference]: Start difference. First operand 2500 states and 4177 transitions. Second operand 15 states. [2018-10-02 12:06:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:04,884 INFO L93 Difference]: Finished difference Result 5837 states and 9708 transitions. [2018-10-02 12:06:04,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-02 12:06:04,884 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-02 12:06:04,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:04,891 INFO L225 Difference]: With dead ends: 5837 [2018-10-02 12:06:04,891 INFO L226 Difference]: Without dead ends: 3072 [2018-10-02 12:06:04,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime [2018-10-02 12:06:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-10-02 12:06:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2605. [2018-10-02 12:06:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2018-10-02 12:06:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4349 transitions. [2018-10-02 12:06:05,715 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4349 transitions. Word has length 15 [2018-10-02 12:06:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:05,715 INFO L480 AbstractCegarLoop]: Abstraction has 2605 states and 4349 transitions. [2018-10-02 12:06:05,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:06:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4349 transitions. [2018-10-02 12:06:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:06:05,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:05,717 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 12:06:05,717 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:05,717 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:05,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1793898800, now seen corresponding path program 1 times [2018-10-02 12:06:05,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:05,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:05,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:05,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:05,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 12:06:05,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:05,889 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:06:05,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:05,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:06,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:06,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-02 12:06:06,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 12:06:06,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 12:06:06,096 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:06,096 INFO L87 Difference]: Start difference. First operand 2605 states and 4349 transitions. Second operand 20 states. [2018-10-02 12:06:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:20,612 INFO L93 Difference]: Finished difference Result 5120 states and 8519 transitions. [2018-10-02 12:06:20,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-02 12:06:20,612 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-10-02 12:06:20,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:20,616 INFO L225 Difference]: With dead ends: 5120 [2018-10-02 12:06:20,616 INFO L226 Difference]: Without dead ends: 3342 [2018-10-02 12:06:20,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 2.1s impTime [2018-10-02 12:06:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2018-10-02 12:06:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 2886. [2018-10-02 12:06:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2886 states. [2018-10-02 12:06:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 4822 transitions. [2018-10-02 12:06:21,498 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 4822 transitions. Word has length 18 [2018-10-02 12:06:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:21,498 INFO L480 AbstractCegarLoop]: Abstraction has 2886 states and 4822 transitions. [2018-10-02 12:06:21,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 12:06:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 4822 transitions. [2018-10-02 12:06:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:06:21,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:21,500 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:21,500 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:21,500 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1793897518, now seen corresponding path program 1 times [2018-10-02 12:06:21,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:21,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:21,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:21,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:21,634 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:06:21,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:21,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 12:06:21,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:21,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-02 12:06:21,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 12:06:21,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 12:06:21,775 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:21,776 INFO L87 Difference]: Start difference. First operand 2886 states and 4822 transitions. Second operand 18 states. [2018-10-02 12:06:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:30,249 INFO L93 Difference]: Finished difference Result 3487 states and 5852 transitions. [2018-10-02 12:06:30,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-02 12:06:30,249 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-02 12:06:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:30,254 INFO L225 Difference]: With dead ends: 3487 [2018-10-02 12:06:30,255 INFO L226 Difference]: Without dead ends: 3485 [2018-10-02 12:06:30,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime [2018-10-02 12:06:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-10-02 12:06:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 2999. [2018-10-02 12:06:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-10-02 12:06:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5026 transitions. [2018-10-02 12:06:31,204 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5026 transitions. Word has length 18 [2018-10-02 12:06:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:31,204 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 5026 transitions. [2018-10-02 12:06:31,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 12:06:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5026 transitions. [2018-10-02 12:06:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:06:31,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:31,205 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:31,206 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:31,206 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-10-02 12:06:31,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:31,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:31,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:31,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:31,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:31,365 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:06:31,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:31,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 12:06:31,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:31,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-02 12:06:31,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 12:06:31,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 12:06:31,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:31,555 INFO L87 Difference]: Start difference. First operand 2999 states and 5026 transitions. Second operand 18 states. [2018-10-02 12:06:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:41,247 INFO L93 Difference]: Finished difference Result 3557 states and 5973 transitions. [2018-10-02 12:06:41,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-02 12:06:41,247 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-02 12:06:41,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:41,251 INFO L225 Difference]: With dead ends: 3557 [2018-10-02 12:06:41,251 INFO L226 Difference]: Without dead ends: 3555 [2018-10-02 12:06:41,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime [2018-10-02 12:06:41,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2018-10-02 12:06:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3102. [2018-10-02 12:06:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2018-10-02 12:06:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 5194 transitions. [2018-10-02 12:06:42,043 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 5194 transitions. Word has length 18 [2018-10-02 12:06:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:42,043 INFO L480 AbstractCegarLoop]: Abstraction has 3102 states and 5194 transitions. [2018-10-02 12:06:42,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 12:06:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 5194 transitions. [2018-10-02 12:06:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:06:42,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:42,045 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:42,045 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:42,045 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:42,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-10-02 12:06:42,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:42,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:42,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:42,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:42,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:42,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:42,146 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:06:42,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:06:42,162 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:06:42,162 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:06:42,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:42,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:42,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-02 12:06:42,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 12:06:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 12:06:42,312 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:42,312 INFO L87 Difference]: Start difference. First operand 3102 states and 5194 transitions. Second operand 18 states. [2018-10-02 12:06:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:57,898 INFO L93 Difference]: Finished difference Result 5268 states and 8851 transitions. [2018-10-02 12:06:57,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-02 12:06:57,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-02 12:06:57,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:57,903 INFO L225 Difference]: With dead ends: 5268 [2018-10-02 12:06:57,903 INFO L226 Difference]: Without dead ends: 5266 [2018-10-02 12:06:57,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time 2.5s impTime [2018-10-02 12:06:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2018-10-02 12:06:58,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 3515. [2018-10-02 12:06:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2018-10-02 12:06:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5926 transitions. [2018-10-02 12:06:58,828 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5926 transitions. Word has length 18 [2018-10-02 12:06:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:58,828 INFO L480 AbstractCegarLoop]: Abstraction has 3515 states and 5926 transitions. [2018-10-02 12:06:58,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 12:06:58,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5926 transitions. [2018-10-02 12:06:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:06:58,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:58,829 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:58,830 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:58,830 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:58,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 2 times [2018-10-02 12:06:58,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:58,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:58,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:58,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:06:58,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:58,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:58,925 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:06:58,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:06:58,941 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:06:58,941 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:06:58,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:59,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:59,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-10-02 12:06:59,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 12:06:59,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 12:06:59,098 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:59,098 INFO L87 Difference]: Start difference. First operand 3515 states and 5926 transitions. Second operand 18 states. [2018-10-02 12:07:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:12,698 INFO L93 Difference]: Finished difference Result 4859 states and 8135 transitions. [2018-10-02 12:07:12,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-02 12:07:12,698 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-02 12:07:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:12,703 INFO L225 Difference]: With dead ends: 4859 [2018-10-02 12:07:12,703 INFO L226 Difference]: Without dead ends: 4857 [2018-10-02 12:07:12,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.0s impTime [2018-10-02 12:07:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2018-10-02 12:07:13,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 3405. [2018-10-02 12:07:13,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3405 states. [2018-10-02 12:07:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 5721 transitions. [2018-10-02 12:07:13,675 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 5721 transitions. Word has length 18 [2018-10-02 12:07:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:13,676 INFO L480 AbstractCegarLoop]: Abstraction has 3405 states and 5721 transitions. [2018-10-02 12:07:13,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 12:07:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 5721 transitions. [2018-10-02 12:07:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:07:13,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:13,677 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 12:07:13,677 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:13,677 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:13,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1231339551, now seen corresponding path program 2 times [2018-10-02 12:07:13,678 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:13,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:13,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:13,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:07:13,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:07:13,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:07:13,796 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:07:13,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:07:13,813 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:07:13,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:07:13,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:07:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:07:13,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:07:13,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-10-02 12:07:13,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:07:13,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:07:13,904 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:13,904 INFO L87 Difference]: Start difference. First operand 3405 states and 5721 transitions. Second operand 16 states. [2018-10-02 12:07:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:20,181 INFO L93 Difference]: Finished difference Result 5774 states and 9598 transitions. [2018-10-02 12:07:20,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-02 12:07:20,181 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-02 12:07:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:20,184 INFO L225 Difference]: With dead ends: 5774 [2018-10-02 12:07:20,184 INFO L226 Difference]: Without dead ends: 3100 [2018-10-02 12:07:20,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime [2018-10-02 12:07:20,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-10-02 12:07:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2583. [2018-10-02 12:07:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2583 states. [2018-10-02 12:07:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4270 transitions. [2018-10-02 12:07:20,953 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4270 transitions. Word has length 18 [2018-10-02 12:07:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:20,953 INFO L480 AbstractCegarLoop]: Abstraction has 2583 states and 4270 transitions. [2018-10-02 12:07:20,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:07:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4270 transitions. [2018-10-02 12:07:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:07:20,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:20,954 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:07:20,954 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:20,955 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:20,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1890837259, now seen corresponding path program 1 times [2018-10-02 12:07:20,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:20,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:20,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:20,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:07:20,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:07:21,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:07:21,068 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:07:21,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:21,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:07:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 12:07:21,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:07:21,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-02 12:07:21,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 12:07:21,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 12:07:21,237 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:21,238 INFO L87 Difference]: Start difference. First operand 2583 states and 4270 transitions. Second operand 18 states. [2018-10-02 12:07:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:27,647 INFO L93 Difference]: Finished difference Result 3114 states and 5123 transitions. [2018-10-02 12:07:27,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-02 12:07:27,647 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-02 12:07:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:27,650 INFO L225 Difference]: With dead ends: 3114 [2018-10-02 12:07:27,650 INFO L226 Difference]: Without dead ends: 3112 [2018-10-02 12:07:27,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime [2018-10-02 12:07:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2018-10-02 12:07:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2773. [2018-10-02 12:07:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2773 states. [2018-10-02 12:07:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4589 transitions. [2018-10-02 12:07:28,488 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4589 transitions. Word has length 18 [2018-10-02 12:07:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:28,488 INFO L480 AbstractCegarLoop]: Abstraction has 2773 states and 4589 transitions. [2018-10-02 12:07:28,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 12:07:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4589 transitions. [2018-10-02 12:07:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:07:28,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:28,489 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 12:07:28,490 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:28,490 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:28,490 INFO L82 PathProgramCache]: Analyzing trace with hash 740718717, now seen corresponding path program 2 times [2018-10-02 12:07:28,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:28,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:28,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:28,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:28,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:07:28,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:07:28,572 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:07:28,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:07:28,587 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:07:28,587 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:07:28,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:07:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:07:28,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:07:28,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-10-02 12:07:28,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 12:07:28,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 12:07:28,747 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:28,747 INFO L87 Difference]: Start difference. First operand 2773 states and 4589 transitions. Second operand 17 states. [2018-10-02 12:07:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:39,182 INFO L93 Difference]: Finished difference Result 4401 states and 7380 transitions. [2018-10-02 12:07:39,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-02 12:07:39,182 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-02 12:07:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:39,186 INFO L225 Difference]: With dead ends: 4401 [2018-10-02 12:07:39,186 INFO L226 Difference]: Without dead ends: 4399 [2018-10-02 12:07:39,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.2s impTime [2018-10-02 12:07:39,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4399 states. [2018-10-02 12:07:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4399 to 3073. [2018-10-02 12:07:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2018-10-02 12:07:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 5108 transitions. [2018-10-02 12:07:40,123 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 5108 transitions. Word has length 18 [2018-10-02 12:07:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:40,123 INFO L480 AbstractCegarLoop]: Abstraction has 3073 states and 5108 transitions. [2018-10-02 12:07:40,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 12:07:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 5108 transitions. [2018-10-02 12:07:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:07:40,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:40,124 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:07:40,125 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:40,125 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:40,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1434281659, now seen corresponding path program 1 times [2018-10-02 12:07:40,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:40,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:40,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:40,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:07:40,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:07:40,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:07:40,240 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:07:40,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:40,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:07:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:07:40,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:07:40,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-02 12:07:40,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 12:07:40,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 12:07:40,755 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:40,755 INFO L87 Difference]: Start difference. First operand 3073 states and 5108 transitions. Second operand 18 states. [2018-10-02 12:07:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:50,863 INFO L93 Difference]: Finished difference Result 4429 states and 7411 transitions. [2018-10-02 12:07:50,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-02 12:07:50,863 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-02 12:07:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:50,867 INFO L225 Difference]: With dead ends: 4429 [2018-10-02 12:07:50,867 INFO L226 Difference]: Without dead ends: 4427 [2018-10-02 12:07:50,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.0s impTime [2018-10-02 12:07:50,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states. [2018-10-02 12:07:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 2723. [2018-10-02 12:07:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2018-10-02 12:07:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4478 transitions. [2018-10-02 12:07:51,767 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4478 transitions. Word has length 18 [2018-10-02 12:07:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:51,767 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 4478 transitions. [2018-10-02 12:07:51,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 12:07:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4478 transitions. [2018-10-02 12:07:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:07:51,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:51,768 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:07:51,768 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:51,768 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:51,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1483012849, now seen corresponding path program 1 times [2018-10-02 12:07:51,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:51,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:51,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:51,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:51,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:07:51,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:07:51,857 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:07:51,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:51,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:07:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:07:52,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:07:52,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-10-02 12:07:52,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 12:07:52,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 12:07:52,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:52,069 INFO L87 Difference]: Start difference. First operand 2723 states and 4478 transitions. Second operand 19 states. [2018-10-02 12:08:03,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:03,592 INFO L93 Difference]: Finished difference Result 4290 states and 7151 transitions. [2018-10-02 12:08:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-02 12:08:03,593 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-10-02 12:08:03,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:03,597 INFO L225 Difference]: With dead ends: 4290 [2018-10-02 12:08:03,597 INFO L226 Difference]: Without dead ends: 4288 [2018-10-02 12:08:03,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.9s impTime [2018-10-02 12:08:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. Received shutdown request... [2018-10-02 12:08:04,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3364. [2018-10-02 12:08:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2018-10-02 12:08:04,859 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 12:08:04,865 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 12:08:04,865 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:08:04 BoogieIcfgContainer [2018-10-02 12:08:04,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:08:04,867 INFO L168 Benchmark]: Toolchain (without parser) took 252018.12 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 467.1 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -397.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-02 12:08:04,869 INFO L168 Benchmark]: Boogie PL CUP Parser 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-02 12:08:04,869 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.09 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-02 12:08:04,869 INFO L168 Benchmark]: Boogie Preprocessor took 23.46 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-02 12:08:04,870 INFO L168 Benchmark]: RCFGBuilder took 501.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 12:08:04,871 INFO L168 Benchmark]: TraceAbstraction took 251441.51 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 467.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -418.5 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-02 12:08:04,874 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser 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. * Boogie Procedure Inliner took 44.09 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. * Boogie Preprocessor took 23.46 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. * RCFGBuilder took 501.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251441.51 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 467.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -418.5 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 37). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 69). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 78). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 4 error locations. TIMEOUT Result, 251.3s OverallTime, 50 OverallIterations, 3 TraceHistogramMax, 220.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1789 SDtfs, 7968 SDslu, 5327 SDs, 0 SdLazy, 35087 SolverSat, 5300 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 49.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2280 GetRequests, 355 SyntacticMatches, 3 SemanticMatches, 1922 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3515occurred in iteration=44, 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: 16.2s AutomataMinimizationTime, 50 MinimizatonAttempts, 14270 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 1162 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 1070 ConstructedInterpolants, 118 QuantifiedInterpolants, 101558 SizeOfPredicates, 184 NumberOfNonLiveVariables, 1770 ConjunctsInSsa, 382 ConjunctsInUnsatCore, 92 InterpolantComputations, 9 PerfectInterpolantSequences, 101/548 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-08-04-892.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-08-04-892.csv Completed graceful shutdown