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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:42:48,646 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:42:48,649 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:42:48,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:42:48,667 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:42:48,668 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:42:48,670 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:42:48,672 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:42:48,674 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:42:48,676 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:42:48,678 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:42:48,678 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:42:48,680 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:42:48,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:42:48,682 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:42:48,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:42:48,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:42:48,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:42:48,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:42:48,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:42:48,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:42:48,692 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:42:48,694 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:42:48,694 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:42:48,694 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:42:48,695 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:42:48,696 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:42:48,697 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:42:48,698 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:42:48,699 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:42:48,699 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:42:48,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:42:48,700 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:42:48,701 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:42:48,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:42:48,702 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:42:48,703 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-09-30 10:42:48,731 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:42:48,732 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:42:48,733 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:42:48,733 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:42:48,734 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:42:48,734 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:42:48,735 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:42:48,735 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:42:48,735 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:42:48,736 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:42:48,737 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:42:48,737 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:42:48,737 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:42:48,737 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:42:48,737 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:42:48,738 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:42:48,738 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:42:48,738 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:42:48,738 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:42:48,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:42:48,740 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:42:48,740 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:42:48,740 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:42:48,741 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:42:48,741 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:42:48,741 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:42:48,741 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:42:48,741 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:42:48,742 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:42:48,742 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:42:48,742 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:42:48,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:42:48,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:42:48,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:42:48,830 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:42:48,831 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:42:48,832 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-09-30 10:42:48,832 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-09-30 10:42:48,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:42:48,904 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:42:48,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:42:48,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:42:48,905 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:42:48,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:48" (1/1) ... [2018-09-30 10:42:48,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:48" (1/1) ... [2018-09-30 10:42:48,943 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:42:48,943 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:42:48,943 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:42:48,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:42:48,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:42:48,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:42:48,947 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:42:48,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:48" (1/1) ... [2018-09-30 10:42:48,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:48" (1/1) ... [2018-09-30 10:42:48,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:48" (1/1) ... [2018-09-30 10:42:48,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:48" (1/1) ... [2018-09-30 10:42:48,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:48" (1/1) ... [2018-09-30 10:42:48,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:48" (1/1) ... [2018-09-30 10:42:48,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:48" (1/1) ... [2018-09-30 10:42:48,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:42:48,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:42:48,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:42:48,973 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:42:48,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:48" (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-09-30 10:42:49,041 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 10:42:49,041 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 10:42:49,042 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 10:42:49,471 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:42:49,472 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:42:49 BoogieIcfgContainer [2018-09-30 10:42:49,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:42:49,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:42:49,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:42:49,477 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:42:49,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:48" (1/2) ... [2018-09-30 10:42:49,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cff90ea and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:42:49, skipping insertion in model container [2018-09-30 10:42:49,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:42:49" (2/2) ... [2018-09-30 10:42:49,481 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-09-30 10:42:49,491 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:42:49,502 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-09-30 10:42:49,552 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:42:49,553 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:42:49,553 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:42:49,553 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:42:49,553 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:42:49,553 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:42:49,553 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:42:49,554 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:42:49,554 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:42:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-30 10:42:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:42:49,575 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:49,576 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:42:49,577 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:49,585 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:49,585 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-09-30 10:42:49,587 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:49,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:49,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:49,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:49,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:49,791 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:49,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:49,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:42:49,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:42:49,812 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:49,814 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-09-30 10:42:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:51,557 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-09-30 10:42:51,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:42:51,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 10:42:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:51,576 INFO L225 Difference]: With dead ends: 49 [2018-09-30 10:42:51,576 INFO L226 Difference]: Without dead ends: 47 [2018-09-30 10:42:51,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-30 10:42:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-09-30 10:42:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 10:42:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-09-30 10:42:51,626 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-09-30 10:42:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:51,626 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-09-30 10:42:51,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:42:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-09-30 10:42:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:42:51,627 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:51,628 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:42:51,629 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:51,629 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-09-30 10:42:51,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:51,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:51,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:51,708 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:51,709 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:51,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:42:51,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:42:51,710 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:51,711 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-09-30 10:42:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:52,470 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-09-30 10:42:52,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:42:52,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 10:42:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:52,474 INFO L225 Difference]: With dead ends: 57 [2018-09-30 10:42:52,475 INFO L226 Difference]: Without dead ends: 55 [2018-09-30 10:42:52,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-30 10:42:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-09-30 10:42:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-30 10:42:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-09-30 10:42:52,487 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-09-30 10:42:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:52,487 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-09-30 10:42:52,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:42:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-09-30 10:42:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:42:52,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:52,489 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:52,489 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:52,490 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:52,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-09-30 10:42:52,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:52,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:52,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:52,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:52,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:52,579 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:52,579 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:42:52,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:42:52,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:42:52,580 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:52,580 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-09-30 10:42:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:54,133 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-09-30 10:42:54,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:42:54,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-30 10:42:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:54,136 INFO L225 Difference]: With dead ends: 84 [2018-09-30 10:42:54,136 INFO L226 Difference]: Without dead ends: 82 [2018-09-30 10:42:54,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-30 10:42:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-09-30 10:42:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-30 10:42:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-09-30 10:42:54,149 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-09-30 10:42:54,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:54,150 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-09-30 10:42:54,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:42:54,150 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-09-30 10:42:54,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:42:54,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:54,151 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-09-30 10:42:54,152 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:54,152 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:54,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-09-30 10:42:54,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:54,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:54,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:54,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:54,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:54,265 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:42:54,265 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-09-30 10:42:54,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:54,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:42:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:54,584 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:42:54,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-09-30 10:42:54,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:42:54,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:42:54,585 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:54,585 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 9 states. [2018-09-30 10:42:57,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:57,040 INFO L93 Difference]: Finished difference Result 142 states and 245 transitions. [2018-09-30 10:42:57,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:42:57,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2018-09-30 10:42:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:57,043 INFO L225 Difference]: With dead ends: 142 [2018-09-30 10:42:57,043 INFO L226 Difference]: Without dead ends: 108 [2018-09-30 10:42:57,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-30 10:42:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 73. [2018-09-30 10:42:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 10:42:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2018-09-30 10:42:57,058 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 7 [2018-09-30 10:42:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:57,059 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 120 transitions. [2018-09-30 10:42:57,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:42:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 120 transitions. [2018-09-30 10:42:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:42:57,060 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:57,060 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:57,060 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:57,061 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:57,061 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-09-30 10:42:57,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:57,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:57,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:57,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:57,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:57,175 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:42:57,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 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-09-30 10:42:57,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:57,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:42:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:57,293 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:42:57,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2018-09-30 10:42:57,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:42:57,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:42:57,294 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:57,294 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. Second operand 11 states. [2018-09-30 10:42:59,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:59,799 INFO L93 Difference]: Finished difference Result 148 states and 240 transitions. [2018-09-30 10:42:59,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:42:59,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-09-30 10:42:59,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:59,801 INFO L225 Difference]: With dead ends: 148 [2018-09-30 10:42:59,801 INFO L226 Difference]: Without dead ends: 97 [2018-09-30 10:42:59,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:59,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-30 10:42:59,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-09-30 10:42:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-30 10:42:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2018-09-30 10:42:59,817 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 9 [2018-09-30 10:42:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:59,818 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2018-09-30 10:42:59,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:42:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2018-09-30 10:42:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:42:59,819 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:59,819 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:59,820 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:59,820 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:59,822 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-09-30 10:42:59,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:59,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:59,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:59,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:59,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:59,910 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:42:59,910 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-09-30 10:42:59,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:59,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:00,094 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:00,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 10:43:00,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:43:00,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:43:00,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:00,095 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand 14 states. [2018-09-30 10:43:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:02,563 INFO L93 Difference]: Finished difference Result 124 states and 193 transitions. [2018-09-30 10:43:02,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:43:02,564 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-30 10:43:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:02,565 INFO L225 Difference]: With dead ends: 124 [2018-09-30 10:43:02,566 INFO L226 Difference]: Without dead ends: 123 [2018-09-30 10:43:02,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-30 10:43:02,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-09-30 10:43:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-30 10:43:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 173 transitions. [2018-09-30 10:43:02,589 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 173 transitions. Word has length 10 [2018-09-30 10:43:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:02,589 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 173 transitions. [2018-09-30 10:43:02,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:43:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 173 transitions. [2018-09-30 10:43:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:43:02,590 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:02,591 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:02,591 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:02,591 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:02,591 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-09-30 10:43:02,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:02,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:02,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:02,688 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:02,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:02,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:02,689 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:02,689 INFO L87 Difference]: Start difference. First operand 107 states and 173 transitions. Second operand 8 states. [2018-09-30 10:43:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:04,202 INFO L93 Difference]: Finished difference Result 132 states and 203 transitions. [2018-09-30 10:43:04,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:43:04,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-30 10:43:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:04,206 INFO L225 Difference]: With dead ends: 132 [2018-09-30 10:43:04,206 INFO L226 Difference]: Without dead ends: 130 [2018-09-30 10:43:04,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-30 10:43:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2018-09-30 10:43:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-30 10:43:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 196 transitions. [2018-09-30 10:43:04,227 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 196 transitions. Word has length 10 [2018-09-30 10:43:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:04,228 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 196 transitions. [2018-09-30 10:43:04,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 196 transitions. [2018-09-30 10:43:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:43:04,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:04,229 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:04,229 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:04,230 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:04,230 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-09-30 10:43:04,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:04,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:04,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:04,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:04,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:04,372 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:04,373 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-09-30 10:43:04,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:04,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:04,767 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:04,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 10:43:04,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:43:04,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:43:04,769 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:04,769 INFO L87 Difference]: Start difference. First operand 121 states and 196 transitions. Second operand 14 states. [2018-09-30 10:43:07,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:07,803 INFO L93 Difference]: Finished difference Result 162 states and 262 transitions. [2018-09-30 10:43:07,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:43:07,804 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-30 10:43:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:07,806 INFO L225 Difference]: With dead ends: 162 [2018-09-30 10:43:07,806 INFO L226 Difference]: Without dead ends: 160 [2018-09-30 10:43:07,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-30 10:43:07,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2018-09-30 10:43:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-30 10:43:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 209 transitions. [2018-09-30 10:43:07,834 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 209 transitions. Word has length 10 [2018-09-30 10:43:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:07,834 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 209 transitions. [2018-09-30 10:43:07,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:43:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 209 transitions. [2018-09-30 10:43:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:43:07,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:07,836 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:07,836 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:07,836 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-09-30 10:43:07,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:07,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:07,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:07,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:07,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:08,130 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:08,130 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-09-30 10:43:08,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:08,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:08,306 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:08,306 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-09-30 10:43:08,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:43:08,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:43:08,307 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:08,307 INFO L87 Difference]: Start difference. First operand 129 states and 209 transitions. Second operand 13 states. [2018-09-30 10:43:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:12,030 INFO L93 Difference]: Finished difference Result 223 states and 343 transitions. [2018-09-30 10:43:12,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 10:43:12,031 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-09-30 10:43:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:12,032 INFO L225 Difference]: With dead ends: 223 [2018-09-30 10:43:12,032 INFO L226 Difference]: Without dead ends: 221 [2018-09-30 10:43:12,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:12,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-30 10:43:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 167. [2018-09-30 10:43:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-30 10:43:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 274 transitions. [2018-09-30 10:43:12,060 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 274 transitions. Word has length 10 [2018-09-30 10:43:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:12,060 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 274 transitions. [2018-09-30 10:43:12,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:43:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 274 transitions. [2018-09-30 10:43:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:43:12,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:12,062 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:12,062 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:12,062 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:12,063 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-09-30 10:43:12,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:12,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:12,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:12,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:12,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:12,162 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:12,163 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-09-30 10:43:12,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:12,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:12,309 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:12,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 10:43:12,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:43:12,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:43:12,309 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:12,310 INFO L87 Difference]: Start difference. First operand 167 states and 274 transitions. Second operand 14 states. [2018-09-30 10:43:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:14,791 INFO L93 Difference]: Finished difference Result 222 states and 351 transitions. [2018-09-30 10:43:14,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 10:43:14,791 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-30 10:43:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:14,792 INFO L225 Difference]: With dead ends: 222 [2018-09-30 10:43:14,792 INFO L226 Difference]: Without dead ends: 221 [2018-09-30 10:43:14,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-30 10:43:14,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 181. [2018-09-30 10:43:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-30 10:43:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 297 transitions. [2018-09-30 10:43:14,817 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 297 transitions. Word has length 10 [2018-09-30 10:43:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:14,817 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 297 transitions. [2018-09-30 10:43:14,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:43:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 297 transitions. [2018-09-30 10:43:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:43:14,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:14,818 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:14,819 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:14,819 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:14,819 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-09-30 10:43:14,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:14,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:14,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:14,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:14,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:14,889 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:14,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:14,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:14,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:14,890 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:14,891 INFO L87 Difference]: Start difference. First operand 181 states and 297 transitions. Second operand 8 states. [2018-09-30 10:43:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:15,911 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2018-09-30 10:43:15,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:43:15,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-30 10:43:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:15,915 INFO L225 Difference]: With dead ends: 203 [2018-09-30 10:43:15,915 INFO L226 Difference]: Without dead ends: 201 [2018-09-30 10:43:15,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-30 10:43:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2018-09-30 10:43:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-30 10:43:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 301 transitions. [2018-09-30 10:43:15,943 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 301 transitions. Word has length 10 [2018-09-30 10:43:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:15,944 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 301 transitions. [2018-09-30 10:43:15,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 301 transitions. [2018-09-30 10:43:15,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:43:15,945 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:15,945 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:15,945 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:15,945 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:15,946 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-09-30 10:43:15,946 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:15,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:15,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:15,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:15,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:16,206 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:16,206 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-09-30 10:43:16,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:16,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:16,307 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:16,307 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 10:43:16,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:43:16,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:43:16,308 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:16,308 INFO L87 Difference]: Start difference. First operand 183 states and 301 transitions. Second operand 14 states. [2018-09-30 10:43:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:18,590 INFO L93 Difference]: Finished difference Result 241 states and 385 transitions. [2018-09-30 10:43:18,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 10:43:18,596 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-30 10:43:18,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:18,597 INFO L225 Difference]: With dead ends: 241 [2018-09-30 10:43:18,598 INFO L226 Difference]: Without dead ends: 240 [2018-09-30 10:43:18,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:18,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-09-30 10:43:18,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2018-09-30 10:43:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-30 10:43:18,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 336 transitions. [2018-09-30 10:43:18,627 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 336 transitions. Word has length 10 [2018-09-30 10:43:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:18,627 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 336 transitions. [2018-09-30 10:43:18,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:43:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 336 transitions. [2018-09-30 10:43:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:43:18,628 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:18,628 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:18,628 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:18,630 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:18,630 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-09-30 10:43:18,631 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:18,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:18,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:18,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:18,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:18,719 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:18,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:18,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:18,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:18,720 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:18,720 INFO L87 Difference]: Start difference. First operand 202 states and 336 transitions. Second operand 8 states. [2018-09-30 10:43:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:19,785 INFO L93 Difference]: Finished difference Result 220 states and 353 transitions. [2018-09-30 10:43:19,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:43:19,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-30 10:43:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:19,787 INFO L225 Difference]: With dead ends: 220 [2018-09-30 10:43:19,787 INFO L226 Difference]: Without dead ends: 218 [2018-09-30 10:43:19,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-30 10:43:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2018-09-30 10:43:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-30 10:43:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2018-09-30 10:43:19,812 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 10 [2018-09-30 10:43:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:19,812 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2018-09-30 10:43:19,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2018-09-30 10:43:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:43:19,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:19,813 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:19,813 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:19,813 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:19,814 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-09-30 10:43:19,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:19,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:19,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:19,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:19,894 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:19,894 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:43:19,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:19,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:20,066 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:20,067 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-09-30 10:43:20,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:43:20,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:43:20,067 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:20,067 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 13 states. [2018-09-30 10:43:24,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:24,855 INFO L93 Difference]: Finished difference Result 320 states and 507 transitions. [2018-09-30 10:43:24,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 10:43:24,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-09-30 10:43:24,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:24,857 INFO L225 Difference]: With dead ends: 320 [2018-09-30 10:43:24,857 INFO L226 Difference]: Without dead ends: 318 [2018-09-30 10:43:24,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-09-30 10:43:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 259. [2018-09-30 10:43:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-30 10:43:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 430 transitions. [2018-09-30 10:43:24,895 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 430 transitions. Word has length 10 [2018-09-30 10:43:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:24,895 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 430 transitions. [2018-09-30 10:43:24,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:43:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 430 transitions. [2018-09-30 10:43:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:43:24,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:24,896 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:24,896 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:24,896 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:24,897 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-09-30 10:43:24,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:24,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:24,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:24,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:25,008 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:25,008 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-09-30 10:43:25,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:25,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:25,144 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:25,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 10:43:25,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:43:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:43:25,145 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:25,145 INFO L87 Difference]: Start difference. First operand 259 states and 430 transitions. Second operand 14 states. [2018-09-30 10:43:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:27,134 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2018-09-30 10:43:27,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:43:27,134 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-30 10:43:27,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:27,135 INFO L225 Difference]: With dead ends: 304 [2018-09-30 10:43:27,136 INFO L226 Difference]: Without dead ends: 302 [2018-09-30 10:43:27,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:27,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-30 10:43:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 270. [2018-09-30 10:43:27,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-09-30 10:43:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 448 transitions. [2018-09-30 10:43:27,180 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 448 transitions. Word has length 10 [2018-09-30 10:43:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:27,181 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 448 transitions. [2018-09-30 10:43:27,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:43:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 448 transitions. [2018-09-30 10:43:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:43:27,182 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:27,182 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:27,182 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:27,182 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:27,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-09-30 10:43:27,182 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:27,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:27,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:27,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:27,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:27,266 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:27,266 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-09-30 10:43:27,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:27,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:27,422 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:27,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 10:43:27,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:43:27,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:43:27,422 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:27,423 INFO L87 Difference]: Start difference. First operand 270 states and 448 transitions. Second operand 14 states. [2018-09-30 10:43:29,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:29,350 INFO L93 Difference]: Finished difference Result 281 states and 455 transitions. [2018-09-30 10:43:29,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:43:29,350 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-30 10:43:29,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:29,352 INFO L225 Difference]: With dead ends: 281 [2018-09-30 10:43:29,352 INFO L226 Difference]: Without dead ends: 280 [2018-09-30 10:43:29,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:29,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-09-30 10:43:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2018-09-30 10:43:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-09-30 10:43:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 447 transitions. [2018-09-30 10:43:29,400 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 447 transitions. Word has length 10 [2018-09-30 10:43:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:29,400 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 447 transitions. [2018-09-30 10:43:29,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:43:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 447 transitions. [2018-09-30 10:43:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:43:29,401 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:29,401 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:29,402 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:29,402 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:29,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-09-30 10:43:29,402 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:29,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:29,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:29,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:29,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:29,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:29,812 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:29,812 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:29,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:29,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:29,813 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:29,813 INFO L87 Difference]: Start difference. First operand 270 states and 447 transitions. Second operand 8 states. [2018-09-30 10:43:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:31,570 INFO L93 Difference]: Finished difference Result 286 states and 460 transitions. [2018-09-30 10:43:31,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:43:31,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-30 10:43:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:31,573 INFO L225 Difference]: With dead ends: 286 [2018-09-30 10:43:31,573 INFO L226 Difference]: Without dead ends: 284 [2018-09-30 10:43:31,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-30 10:43:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2018-09-30 10:43:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-30 10:43:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 443 transitions. [2018-09-30 10:43:31,623 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 443 transitions. Word has length 10 [2018-09-30 10:43:31,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:31,623 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 443 transitions. [2018-09-30 10:43:31,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 443 transitions. [2018-09-30 10:43:31,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:31,624 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:31,624 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:31,625 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:31,625 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:31,625 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-09-30 10:43:31,625 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:31,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:31,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:31,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:31,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:32,483 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:32,483 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-09-30 10:43:32,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:32,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:32,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:32,836 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:32,837 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-09-30 10:43:32,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:43:32,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:43:32,837 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:32,838 INFO L87 Difference]: Start difference. First operand 268 states and 443 transitions. Second operand 16 states. [2018-09-30 10:43:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:37,720 INFO L93 Difference]: Finished difference Result 515 states and 842 transitions. [2018-09-30 10:43:37,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 10:43:37,721 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-09-30 10:43:37,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:37,723 INFO L225 Difference]: With dead ends: 515 [2018-09-30 10:43:37,724 INFO L226 Difference]: Without dead ends: 513 [2018-09-30 10:43:37,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-09-30 10:43:37,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 338. [2018-09-30 10:43:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-09-30 10:43:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 568 transitions. [2018-09-30 10:43:37,796 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 568 transitions. Word has length 12 [2018-09-30 10:43:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:37,796 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 568 transitions. [2018-09-30 10:43:37,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:43:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 568 transitions. [2018-09-30 10:43:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:37,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:37,797 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:37,798 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:37,798 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:37,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-09-30 10:43:37,798 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:37,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:37,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:37,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:37,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:38,157 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:38,157 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-09-30 10:43:38,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:38,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:38,318 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:38,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-09-30 10:43:38,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:43:38,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:43:38,319 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:38,319 INFO L87 Difference]: Start difference. First operand 338 states and 568 transitions. Second operand 16 states. [2018-09-30 10:43:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:42,828 INFO L93 Difference]: Finished difference Result 631 states and 1050 transitions. [2018-09-30 10:43:42,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 10:43:42,829 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-09-30 10:43:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:42,832 INFO L225 Difference]: With dead ends: 631 [2018-09-30 10:43:42,832 INFO L226 Difference]: Without dead ends: 629 [2018-09-30 10:43:42,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-30 10:43:42,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 403. [2018-09-30 10:43:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-30 10:43:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 685 transitions. [2018-09-30 10:43:42,918 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 685 transitions. Word has length 12 [2018-09-30 10:43:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:42,918 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 685 transitions. [2018-09-30 10:43:42,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:43:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 685 transitions. [2018-09-30 10:43:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:43:42,919 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:42,919 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:42,919 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:42,919 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:42,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-09-30 10:43:42,920 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:42,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:42,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:42,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:42,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:43,074 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:43,074 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-09-30 10:43:43,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:43,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:43,179 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:43:43,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-09-30 10:43:43,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:43:43,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:43:43,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:43,180 INFO L87 Difference]: Start difference. First operand 403 states and 685 transitions. Second operand 14 states. [2018-09-30 10:43:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:49,146 INFO L93 Difference]: Finished difference Result 1330 states and 2225 transitions. [2018-09-30 10:43:49,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 10:43:49,146 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 10:43:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:49,150 INFO L225 Difference]: With dead ends: 1330 [2018-09-30 10:43:49,150 INFO L226 Difference]: Without dead ends: 929 [2018-09-30 10:43:49,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:49,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-09-30 10:43:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 694. [2018-09-30 10:43:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-09-30 10:43:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1171 transitions. [2018-09-30 10:43:49,301 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1171 transitions. Word has length 13 [2018-09-30 10:43:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:49,301 INFO L480 AbstractCegarLoop]: Abstraction has 694 states and 1171 transitions. [2018-09-30 10:43:49,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:43:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1171 transitions. [2018-09-30 10:43:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:43:49,302 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:49,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:49,302 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:49,303 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:49,303 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-09-30 10:43:49,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:49,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:49,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:49,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:49,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:49,387 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:49,387 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-09-30 10:43:49,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:49,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:49,738 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:49,739 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-09-30 10:43:49,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:43:49,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:43:49,739 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:49,739 INFO L87 Difference]: Start difference. First operand 694 states and 1171 transitions. Second operand 14 states. [2018-09-30 10:43:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:54,389 INFO L93 Difference]: Finished difference Result 1557 states and 2604 transitions. [2018-09-30 10:43:54,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:43:54,389 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 10:43:54,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:54,392 INFO L225 Difference]: With dead ends: 1557 [2018-09-30 10:43:54,392 INFO L226 Difference]: Without dead ends: 864 [2018-09-30 10:43:54,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-09-30 10:43:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 741. [2018-09-30 10:43:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-09-30 10:43:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1247 transitions. [2018-09-30 10:43:54,561 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1247 transitions. Word has length 13 [2018-09-30 10:43:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:54,561 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 1247 transitions. [2018-09-30 10:43:54,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:43:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1247 transitions. [2018-09-30 10:43:54,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:43:54,562 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:54,562 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:54,563 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:54,563 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:54,563 INFO L82 PathProgramCache]: Analyzing trace with hash -63701769, now seen corresponding path program 1 times [2018-09-30 10:43:54,563 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:54,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:54,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:54,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:54,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:54,707 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:54,708 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-09-30 10:43:54,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:54,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:54,830 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:54,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-09-30 10:43:54,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:43:54,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:43:54,831 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:54,831 INFO L87 Difference]: Start difference. First operand 741 states and 1247 transitions. Second operand 13 states. [2018-09-30 10:43:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:57,999 INFO L93 Difference]: Finished difference Result 1655 states and 2757 transitions. [2018-09-30 10:43:58,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:43:58,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-30 10:43:58,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:58,005 INFO L225 Difference]: With dead ends: 1655 [2018-09-30 10:43:58,005 INFO L226 Difference]: Without dead ends: 915 [2018-09-30 10:43:58,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-30 10:43:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 809. [2018-09-30 10:43:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-09-30 10:43:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1353 transitions. [2018-09-30 10:43:58,154 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1353 transitions. Word has length 13 [2018-09-30 10:43:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:58,154 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1353 transitions. [2018-09-30 10:43:58,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:43:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1353 transitions. [2018-09-30 10:43:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:43:58,155 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:58,155 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:58,155 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:58,156 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 1 times [2018-09-30 10:43:58,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:58,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:58,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:58,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:58,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:58,242 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:58,242 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-09-30 10:43:58,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:58,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:58,312 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:58,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-09-30 10:43:58,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:43:58,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:43:58,313 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:58,313 INFO L87 Difference]: Start difference. First operand 809 states and 1353 transitions. Second operand 10 states. [2018-09-30 10:44:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:00,368 INFO L93 Difference]: Finished difference Result 939 states and 1541 transitions. [2018-09-30 10:44:00,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:44:00,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-09-30 10:44:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:00,371 INFO L225 Difference]: With dead ends: 939 [2018-09-30 10:44:00,372 INFO L226 Difference]: Without dead ends: 937 [2018-09-30 10:44:00,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-09-30 10:44:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 820. [2018-09-30 10:44:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-09-30 10:44:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1367 transitions. [2018-09-30 10:44:00,518 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1367 transitions. Word has length 13 [2018-09-30 10:44:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:00,519 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 1367 transitions. [2018-09-30 10:44:00,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:44:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1367 transitions. [2018-09-30 10:44:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:44:00,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:00,519 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:00,520 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:00,520 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:00,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1799471129, now seen corresponding path program 1 times [2018-09-30 10:44:00,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:00,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:00,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:00,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:00,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:00,672 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:00,673 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-09-30 10:44:00,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:00,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:01,123 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:44:01,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-09-30 10:44:01,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:44:01,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:44:01,124 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:01,124 INFO L87 Difference]: Start difference. First operand 820 states and 1367 transitions. Second operand 14 states. [2018-09-30 10:44:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:06,281 INFO L93 Difference]: Finished difference Result 2058 states and 3403 transitions. [2018-09-30 10:44:06,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 10:44:06,281 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 10:44:06,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:06,287 INFO L225 Difference]: With dead ends: 2058 [2018-09-30 10:44:06,287 INFO L226 Difference]: Without dead ends: 1239 [2018-09-30 10:44:06,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:06,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2018-09-30 10:44:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 899. [2018-09-30 10:44:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-09-30 10:44:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1500 transitions. [2018-09-30 10:44:06,542 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1500 transitions. Word has length 13 [2018-09-30 10:44:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:06,542 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1500 transitions. [2018-09-30 10:44:06,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:44:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1500 transitions. [2018-09-30 10:44:06,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:44:06,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:06,543 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:06,544 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:06,544 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:06,544 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-09-30 10:44:06,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:06,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:06,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:06,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:06,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:07,096 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:07,096 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-09-30 10:44:07,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:07,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:07,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:07,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-09-30 10:44:07,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:44:07,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:44:07,792 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:07,793 INFO L87 Difference]: Start difference. First operand 899 states and 1500 transitions. Second operand 10 states. [2018-09-30 10:44:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:09,981 INFO L93 Difference]: Finished difference Result 1038 states and 1712 transitions. [2018-09-30 10:44:09,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:44:09,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-09-30 10:44:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:09,986 INFO L225 Difference]: With dead ends: 1038 [2018-09-30 10:44:09,986 INFO L226 Difference]: Without dead ends: 1036 [2018-09-30 10:44:09,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-09-30 10:44:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 897. [2018-09-30 10:44:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-09-30 10:44:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1498 transitions. [2018-09-30 10:44:10,158 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1498 transitions. Word has length 13 [2018-09-30 10:44:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:10,158 INFO L480 AbstractCegarLoop]: Abstraction has 897 states and 1498 transitions. [2018-09-30 10:44:10,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:44:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1498 transitions. [2018-09-30 10:44:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:44:10,159 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:10,159 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:10,159 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:10,160 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:10,162 INFO L82 PathProgramCache]: Analyzing trace with hash 290277111, now seen corresponding path program 1 times [2018-09-30 10:44:10,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:10,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:10,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:10,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:10,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:10,327 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:10,327 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-09-30 10:44:10,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:10,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:10,473 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:44:10,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-09-30 10:44:10,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:44:10,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:44:10,474 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:10,474 INFO L87 Difference]: Start difference. First operand 897 states and 1498 transitions. Second operand 14 states. [2018-09-30 10:44:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:15,376 INFO L93 Difference]: Finished difference Result 2193 states and 3616 transitions. [2018-09-30 10:44:15,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 10:44:15,376 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 10:44:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:15,380 INFO L225 Difference]: With dead ends: 2193 [2018-09-30 10:44:15,380 INFO L226 Difference]: Without dead ends: 1286 [2018-09-30 10:44:15,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:15,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2018-09-30 10:44:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 995. [2018-09-30 10:44:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-09-30 10:44:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1646 transitions. [2018-09-30 10:44:15,608 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1646 transitions. Word has length 13 [2018-09-30 10:44:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:15,609 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1646 transitions. [2018-09-30 10:44:15,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:44:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1646 transitions. [2018-09-30 10:44:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:44:15,609 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:15,609 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:15,610 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:15,610 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:15,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2115278289, now seen corresponding path program 1 times [2018-09-30 10:44:15,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:15,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:15,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:15,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:15,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:15,677 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:15,678 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-09-30 10:44:15,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:15,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:15,839 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:15,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-09-30 10:44:15,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:44:15,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:44:15,840 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:15,840 INFO L87 Difference]: Start difference. First operand 995 states and 1646 transitions. Second operand 14 states. [2018-09-30 10:44:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:19,961 INFO L93 Difference]: Finished difference Result 2165 states and 3551 transitions. [2018-09-30 10:44:19,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:44:19,968 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 10:44:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:19,972 INFO L225 Difference]: With dead ends: 2165 [2018-09-30 10:44:19,972 INFO L226 Difference]: Without dead ends: 1153 [2018-09-30 10:44:19,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-09-30 10:44:20,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1001. [2018-09-30 10:44:20,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-09-30 10:44:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1642 transitions. [2018-09-30 10:44:20,151 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1642 transitions. Word has length 13 [2018-09-30 10:44:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:20,151 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1642 transitions. [2018-09-30 10:44:20,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:44:20,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1642 transitions. [2018-09-30 10:44:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:44:20,153 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:20,153 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:20,153 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:20,153 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:20,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2141517287, now seen corresponding path program 1 times [2018-09-30 10:44:20,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:20,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:20,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:20,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:20,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:20,224 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:20,224 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-09-30 10:44:20,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:20,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:20,369 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:20,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-09-30 10:44:20,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:44:20,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:44:20,370 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:20,370 INFO L87 Difference]: Start difference. First operand 1001 states and 1642 transitions. Second operand 13 states. [2018-09-30 10:44:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:23,604 INFO L93 Difference]: Finished difference Result 1397 states and 2244 transitions. [2018-09-30 10:44:23,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:44:23,604 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-30 10:44:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:23,608 INFO L225 Difference]: With dead ends: 1397 [2018-09-30 10:44:23,608 INFO L226 Difference]: Without dead ends: 1125 [2018-09-30 10:44:23,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-09-30 10:44:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 995. [2018-09-30 10:44:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-09-30 10:44:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1627 transitions. [2018-09-30 10:44:23,806 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1627 transitions. Word has length 13 [2018-09-30 10:44:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:23,806 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1627 transitions. [2018-09-30 10:44:23,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:44:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1627 transitions. [2018-09-30 10:44:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:44:23,807 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:23,807 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:23,807 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:23,807 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:23,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-09-30 10:44:23,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:23,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:23,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:23,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:23,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:23,926 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:23,927 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-09-30 10:44:23,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:23,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:24,024 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:44:24,024 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-09-30 10:44:24,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:44:24,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:44:24,025 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:24,025 INFO L87 Difference]: Start difference. First operand 995 states and 1627 transitions. Second operand 14 states. [2018-09-30 10:44:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:29,688 INFO L93 Difference]: Finished difference Result 2724 states and 4397 transitions. [2018-09-30 10:44:29,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 10:44:29,689 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 10:44:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:29,695 INFO L225 Difference]: With dead ends: 2724 [2018-09-30 10:44:29,695 INFO L226 Difference]: Without dead ends: 1719 [2018-09-30 10:44:29,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:29,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2018-09-30 10:44:29,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1241. [2018-09-30 10:44:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2018-09-30 10:44:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2017 transitions. [2018-09-30 10:44:29,941 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2017 transitions. Word has length 13 [2018-09-30 10:44:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:29,941 INFO L480 AbstractCegarLoop]: Abstraction has 1241 states and 2017 transitions. [2018-09-30 10:44:29,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:44:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2017 transitions. [2018-09-30 10:44:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:44:29,942 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:29,942 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:29,942 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:29,942 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:29,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1374164806, now seen corresponding path program 1 times [2018-09-30 10:44:29,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:29,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:29,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:30,042 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:30,042 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-09-30 10:44:30,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:30,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:30,221 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:30,221 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2018-09-30 10:44:30,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:44:30,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:44:30,221 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:30,222 INFO L87 Difference]: Start difference. First operand 1241 states and 2017 transitions. Second operand 17 states. [2018-09-30 10:44:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:34,930 INFO L93 Difference]: Finished difference Result 1442 states and 2324 transitions. [2018-09-30 10:44:34,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:44:34,930 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-09-30 10:44:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:34,935 INFO L225 Difference]: With dead ends: 1442 [2018-09-30 10:44:34,935 INFO L226 Difference]: Without dead ends: 1440 [2018-09-30 10:44:34,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-09-30 10:44:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1225. [2018-09-30 10:44:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-09-30 10:44:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1983 transitions. [2018-09-30 10:44:35,207 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1983 transitions. Word has length 15 [2018-09-30 10:44:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:35,207 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 1983 transitions. [2018-09-30 10:44:35,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:44:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1983 transitions. [2018-09-30 10:44:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:44:35,208 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:35,208 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:35,208 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:35,209 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:35,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-09-30 10:44:35,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:35,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:35,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:35,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:35,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:36,083 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:36,083 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-09-30 10:44:36,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:36,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:36,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:36,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-09-30 10:44:36,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:44:36,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:44:36,267 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:36,267 INFO L87 Difference]: Start difference. First operand 1225 states and 1983 transitions. Second operand 16 states. [2018-09-30 10:44:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:39,886 INFO L93 Difference]: Finished difference Result 1389 states and 2225 transitions. [2018-09-30 10:44:39,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:44:39,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-30 10:44:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:39,892 INFO L225 Difference]: With dead ends: 1389 [2018-09-30 10:44:39,892 INFO L226 Difference]: Without dead ends: 1387 [2018-09-30 10:44:39,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2018-09-30 10:44:40,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1211. [2018-09-30 10:44:40,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-09-30 10:44:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1953 transitions. [2018-09-30 10:44:40,162 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1953 transitions. Word has length 15 [2018-09-30 10:44:40,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:40,162 INFO L480 AbstractCegarLoop]: Abstraction has 1211 states and 1953 transitions. [2018-09-30 10:44:40,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:44:40,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1953 transitions. [2018-09-30 10:44:40,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:44:40,163 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:40,163 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:40,163 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:40,163 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:40,164 INFO L82 PathProgramCache]: Analyzing trace with hash -593242831, now seen corresponding path program 1 times [2018-09-30 10:44:40,164 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:40,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:40,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:40,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:40,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:40,404 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:40,404 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-09-30 10:44:40,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:40,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:40,617 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:40,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-09-30 10:44:40,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:44:40,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:44:40,618 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:40,618 INFO L87 Difference]: Start difference. First operand 1211 states and 1953 transitions. Second operand 14 states. [2018-09-30 10:44:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:46,919 INFO L93 Difference]: Finished difference Result 1445 states and 2303 transitions. [2018-09-30 10:44:46,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:44:46,919 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-09-30 10:44:46,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:46,924 INFO L225 Difference]: With dead ends: 1445 [2018-09-30 10:44:46,924 INFO L226 Difference]: Without dead ends: 1443 [2018-09-30 10:44:46,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:46,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2018-09-30 10:44:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1205. [2018-09-30 10:44:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-30 10:44:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-09-30 10:44:47,204 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-09-30 10:44:47,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:47,205 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-09-30 10:44:47,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:44:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-09-30 10:44:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:44:47,206 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:47,206 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:47,206 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:47,206 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:47,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1223170690, now seen corresponding path program 1 times [2018-09-30 10:44:47,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:47,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:47,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:47,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:47,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:47,351 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:47,351 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-09-30 10:44:47,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:47,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:47,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:47,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-09-30 10:44:47,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:44:47,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:44:47,590 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:47,590 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 15 states. [2018-09-30 10:44:53,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:53,080 INFO L93 Difference]: Finished difference Result 1420 states and 2265 transitions. [2018-09-30 10:44:53,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:44:53,081 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-09-30 10:44:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:53,086 INFO L225 Difference]: With dead ends: 1420 [2018-09-30 10:44:53,086 INFO L226 Difference]: Without dead ends: 1418 [2018-09-30 10:44:53,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-09-30 10:44:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1213. [2018-09-30 10:44:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2018-09-30 10:44:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1951 transitions. [2018-09-30 10:44:53,336 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1951 transitions. Word has length 16 [2018-09-30 10:44:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:53,337 INFO L480 AbstractCegarLoop]: Abstraction has 1213 states and 1951 transitions. [2018-09-30 10:44:53,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:44:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1951 transitions. [2018-09-30 10:44:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:44:53,337 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:53,338 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:53,338 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:53,338 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:53,338 INFO L82 PathProgramCache]: Analyzing trace with hash -767609008, now seen corresponding path program 2 times [2018-09-30 10:44:53,338 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:53,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:53,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:53,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:53,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:53,430 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:53,430 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-09-30 10:44:53,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:44:53,468 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:44:53,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:44:53,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:53,526 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:53,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-30 10:44:53,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:44:53,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:44:53,527 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:53,527 INFO L87 Difference]: Start difference. First operand 1213 states and 1951 transitions. Second operand 11 states. [2018-09-30 10:44:56,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:56,353 INFO L93 Difference]: Finished difference Result 1334 states and 2129 transitions. [2018-09-30 10:44:56,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:44:56,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-09-30 10:44:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:56,359 INFO L225 Difference]: With dead ends: 1334 [2018-09-30 10:44:56,359 INFO L226 Difference]: Without dead ends: 1332 [2018-09-30 10:44:56,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2018-09-30 10:44:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1205. [2018-09-30 10:44:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-30 10:44:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-09-30 10:44:56,624 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-09-30 10:44:56,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:56,624 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-09-30 10:44:56,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:44:56,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-09-30 10:44:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:44:56,625 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:56,625 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:56,625 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:56,625 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:56,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106549, now seen corresponding path program 1 times [2018-09-30 10:44:56,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:56,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:56,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:56,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:44:56,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:56,708 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:56,708 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-09-30 10:44:56,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:56,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:56,781 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:56,781 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-30 10:44:56,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:44:56,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:44:56,781 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:56,781 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 11 states. [2018-09-30 10:44:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:59,471 INFO L93 Difference]: Finished difference Result 1330 states and 2118 transitions. [2018-09-30 10:44:59,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:44:59,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-09-30 10:44:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:59,477 INFO L225 Difference]: With dead ends: 1330 [2018-09-30 10:44:59,477 INFO L226 Difference]: Without dead ends: 1328 [2018-09-30 10:44:59,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-09-30 10:44:59,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1211. [2018-09-30 10:44:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-09-30 10:44:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1948 transitions. [2018-09-30 10:44:59,735 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1948 transitions. Word has length 16 [2018-09-30 10:44:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:59,735 INFO L480 AbstractCegarLoop]: Abstraction has 1211 states and 1948 transitions. [2018-09-30 10:44:59,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:44:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1948 transitions. [2018-09-30 10:44:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:44:59,736 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:59,736 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:59,737 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:59,737 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:59,737 INFO L82 PathProgramCache]: Analyzing trace with hash 481081049, now seen corresponding path program 2 times [2018-09-30 10:44:59,737 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:59,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:59,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:59,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:59,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:59,847 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:59,847 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-09-30 10:44:59,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:44:59,865 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:44:59,866 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:44:59,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:00,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:00,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-09-30 10:45:00,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:45:00,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:45:00,013 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:00,013 INFO L87 Difference]: Start difference. First operand 1211 states and 1948 transitions. Second operand 14 states. [2018-09-30 10:45:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:04,694 INFO L93 Difference]: Finished difference Result 1430 states and 2273 transitions. [2018-09-30 10:45:04,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:45:04,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-09-30 10:45:04,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:04,698 INFO L225 Difference]: With dead ends: 1430 [2018-09-30 10:45:04,698 INFO L226 Difference]: Without dead ends: 1428 [2018-09-30 10:45:04,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2018-09-30 10:45:04,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1205. [2018-09-30 10:45:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-30 10:45:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-09-30 10:45:04,976 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-09-30 10:45:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:04,976 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-09-30 10:45:04,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:45:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-09-30 10:45:04,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:45:04,977 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:04,977 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:04,977 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:04,977 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:04,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1936399254, now seen corresponding path program 1 times [2018-09-30 10:45:04,977 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:04,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:04,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:04,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:45:04,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:05,405 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:05,405 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-09-30 10:45:05,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:05,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:05,637 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:05,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-09-30 10:45:05,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:45:05,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:45:05,637 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:05,637 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 13 states. [2018-09-30 10:45:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:10,817 INFO L93 Difference]: Finished difference Result 1432 states and 2278 transitions. [2018-09-30 10:45:10,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:45:10,817 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-09-30 10:45:10,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:10,820 INFO L225 Difference]: With dead ends: 1432 [2018-09-30 10:45:10,820 INFO L226 Difference]: Without dead ends: 1430 [2018-09-30 10:45:10,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-09-30 10:45:11,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1199. [2018-09-30 10:45:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-09-30 10:45:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1923 transitions. [2018-09-30 10:45:11,097 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1923 transitions. Word has length 16 [2018-09-30 10:45:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:11,097 INFO L480 AbstractCegarLoop]: Abstraction has 1199 states and 1923 transitions. [2018-09-30 10:45:11,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:45:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1923 transitions. [2018-09-30 10:45:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:45:11,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:11,098 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:11,099 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:11,099 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:11,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1085218294, now seen corresponding path program 1 times [2018-09-30 10:45:11,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:11,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:11,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:11,276 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:11,276 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-09-30 10:45:11,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:11,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:11,392 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:45:11,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2018-09-30 10:45:11,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:45:11,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:45:11,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:11,393 INFO L87 Difference]: Start difference. First operand 1199 states and 1923 transitions. Second operand 17 states. [2018-09-30 10:45:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:20,033 INFO L93 Difference]: Finished difference Result 1695 states and 2653 transitions. [2018-09-30 10:45:20,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-30 10:45:20,033 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-09-30 10:45:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:20,035 INFO L225 Difference]: With dead ends: 1695 [2018-09-30 10:45:20,036 INFO L226 Difference]: Without dead ends: 1376 [2018-09-30 10:45:20,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2018-09-30 10:45:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1028. [2018-09-30 10:45:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-09-30 10:45:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1643 transitions. [2018-09-30 10:45:20,282 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1643 transitions. Word has length 18 [2018-09-30 10:45:20,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:20,282 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1643 transitions. [2018-09-30 10:45:20,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:45:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1643 transitions. [2018-09-30 10:45:20,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:45:20,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:20,283 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:20,283 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:20,284 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:20,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1597439053, now seen corresponding path program 1 times [2018-09-30 10:45:20,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:20,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:20,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:20,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:20,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:20,402 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:20,402 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-09-30 10:45:20,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:20,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:20,519 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:20,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-09-30 10:45:20,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:45:20,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:45:20,519 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:20,520 INFO L87 Difference]: Start difference. First operand 1028 states and 1643 transitions. Second operand 16 states. [2018-09-30 10:45:25,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:25,431 INFO L93 Difference]: Finished difference Result 1514 states and 2354 transitions. [2018-09-30 10:45:25,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 10:45:25,434 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-30 10:45:25,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:25,436 INFO L225 Difference]: With dead ends: 1514 [2018-09-30 10:45:25,437 INFO L226 Difference]: Without dead ends: 1219 [2018-09-30 10:45:25,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-30 10:45:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1024. [2018-09-30 10:45:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-09-30 10:45:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1632 transitions. [2018-09-30 10:45:25,847 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1632 transitions. Word has length 18 [2018-09-30 10:45:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:25,847 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1632 transitions. [2018-09-30 10:45:25,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:45:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1632 transitions. [2018-09-30 10:45:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:45:25,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:25,848 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:25,849 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:25,849 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:25,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1672170852, now seen corresponding path program 1 times [2018-09-30 10:45:25,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:25,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:25,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:25,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:25,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:45:26,390 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:26,390 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-09-30 10:45:26,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:26,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:26,547 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:26,547 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-09-30 10:45:26,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:45:26,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:45:26,548 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:26,548 INFO L87 Difference]: Start difference. First operand 1024 states and 1632 transitions. Second operand 16 states. [2018-09-30 10:45:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:31,953 INFO L93 Difference]: Finished difference Result 2556 states and 4045 transitions. [2018-09-30 10:45:31,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:45:31,958 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-30 10:45:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:31,961 INFO L225 Difference]: With dead ends: 2556 [2018-09-30 10:45:31,961 INFO L226 Difference]: Without dead ends: 1529 [2018-09-30 10:45:31,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-09-30 10:45:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1073. [2018-09-30 10:45:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2018-09-30 10:45:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1703 transitions. [2018-09-30 10:45:32,229 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1703 transitions. Word has length 18 [2018-09-30 10:45:32,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:32,229 INFO L480 AbstractCegarLoop]: Abstraction has 1073 states and 1703 transitions. [2018-09-30 10:45:32,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:45:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1703 transitions. [2018-09-30 10:45:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:45:32,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:32,230 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:32,230 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:32,230 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:32,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1136854538, now seen corresponding path program 1 times [2018-09-30 10:45:32,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:32,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:32,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:32,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:32,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:32,925 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:32,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 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-09-30 10:45:32,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:32,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:33,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:33,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-30 10:45:33,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:45:33,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:45:33,058 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:33,058 INFO L87 Difference]: Start difference. First operand 1073 states and 1703 transitions. Second operand 15 states. [2018-09-30 10:45:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:38,184 INFO L93 Difference]: Finished difference Result 1546 states and 2389 transitions. [2018-09-30 10:45:38,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 10:45:38,184 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-09-30 10:45:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:38,187 INFO L225 Difference]: With dead ends: 1546 [2018-09-30 10:45:38,187 INFO L226 Difference]: Without dead ends: 1291 [2018-09-30 10:45:38,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-09-30 10:45:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1056. [2018-09-30 10:45:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-30 10:45:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1674 transitions. [2018-09-30 10:45:38,553 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1674 transitions. Word has length 18 [2018-09-30 10:45:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:38,553 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1674 transitions. [2018-09-30 10:45:38,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:45:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1674 transitions. [2018-09-30 10:45:38,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:45:38,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:38,555 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:38,555 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:38,555 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:38,555 INFO L82 PathProgramCache]: Analyzing trace with hash 975863549, now seen corresponding path program 1 times [2018-09-30 10:45:38,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:38,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:38,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:38,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:38,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:38,617 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:38,618 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-09-30 10:45:38,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:38,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:38,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:38,685 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:45:38,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:45:38,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:45:38,685 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:38,685 INFO L87 Difference]: Start difference. First operand 1056 states and 1674 transitions. Second operand 7 states. [2018-09-30 10:45:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:39,926 INFO L93 Difference]: Finished difference Result 1635 states and 2515 transitions. [2018-09-30 10:45:39,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:45:39,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-09-30 10:45:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:39,930 INFO L225 Difference]: With dead ends: 1635 [2018-09-30 10:45:39,930 INFO L226 Difference]: Without dead ends: 1494 [2018-09-30 10:45:39,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2018-09-30 10:45:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1094. [2018-09-30 10:45:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-09-30 10:45:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1728 transitions. [2018-09-30 10:45:40,395 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1728 transitions. Word has length 18 [2018-09-30 10:45:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:40,396 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 1728 transitions. [2018-09-30 10:45:40,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:45:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1728 transitions. [2018-09-30 10:45:40,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:45:40,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:40,397 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-09-30 10:45:40,397 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:40,397 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1152261854, now seen corresponding path program 1 times [2018-09-30 10:45:40,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:40,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:40,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:40,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:40,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:40,564 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:40,564 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-09-30 10:45:40,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:40,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:40,751 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:40,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 19 [2018-09-30 10:45:40,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 10:45:40,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 10:45:40,751 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:40,751 INFO L87 Difference]: Start difference. First operand 1094 states and 1728 transitions. Second operand 20 states. [2018-09-30 10:45:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:51,538 INFO L93 Difference]: Finished difference Result 2230 states and 3534 transitions. [2018-09-30 10:45:51,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-30 10:45:51,538 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-09-30 10:45:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:51,542 INFO L225 Difference]: With dead ends: 2230 [2018-09-30 10:45:51,542 INFO L226 Difference]: Without dead ends: 2180 [2018-09-30 10:45:51,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:51,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2018-09-30 10:45:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 1150. [2018-09-30 10:45:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2018-09-30 10:45:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1853 transitions. [2018-09-30 10:45:52,069 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1853 transitions. Word has length 20 [2018-09-30 10:45:52,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:52,069 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 1853 transitions. [2018-09-30 10:45:52,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 10:45:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1853 transitions. [2018-09-30 10:45:52,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:45:52,070 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:52,070 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:52,071 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:52,071 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:52,071 INFO L82 PathProgramCache]: Analyzing trace with hash -79326665, now seen corresponding path program 1 times [2018-09-30 10:45:52,071 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:52,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:52,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:52,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:52,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:52,177 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:45:52,178 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:52,178 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-09-30 10:45:52,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:52,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:45:52,243 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:52,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:45:52,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:45:52,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:45:52,243 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:52,243 INFO L87 Difference]: Start difference. First operand 1150 states and 1853 transitions. Second operand 7 states. [2018-09-30 10:45:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:53,039 INFO L93 Difference]: Finished difference Result 1760 states and 2751 transitions. [2018-09-30 10:45:53,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:45:53,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-09-30 10:45:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:53,042 INFO L225 Difference]: With dead ends: 1760 [2018-09-30 10:45:53,042 INFO L226 Difference]: Without dead ends: 1507 [2018-09-30 10:45:53,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:53,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-09-30 10:45:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1026. [2018-09-30 10:45:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2018-09-30 10:45:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1655 transitions. [2018-09-30 10:45:53,448 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1655 transitions. Word has length 20 [2018-09-30 10:45:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:53,448 INFO L480 AbstractCegarLoop]: Abstraction has 1026 states and 1655 transitions. [2018-09-30 10:45:53,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:45:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1655 transitions. [2018-09-30 10:45:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:45:53,448 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:53,449 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-09-30 10:45:53,449 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:53,449 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash -79325383, now seen corresponding path program 1 times [2018-09-30 10:45:53,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:53,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:53,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:53,553 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:53,553 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-09-30 10:45:53,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:53,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:53,713 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:53,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-30 10:45:53,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:45:53,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:45:53,714 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:53,714 INFO L87 Difference]: Start difference. First operand 1026 states and 1655 transitions. Second operand 17 states. [2018-09-30 10:46:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:00,544 INFO L93 Difference]: Finished difference Result 1878 states and 3019 transitions. [2018-09-30 10:46:00,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 10:46:00,545 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-09-30 10:46:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:00,547 INFO L225 Difference]: With dead ends: 1878 [2018-09-30 10:46:00,547 INFO L226 Difference]: Without dead ends: 1729 [2018-09-30 10:46:00,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:00,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2018-09-30 10:46:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1013. [2018-09-30 10:46:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-09-30 10:46:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1646 transitions. [2018-09-30 10:46:00,937 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1646 transitions. Word has length 20 [2018-09-30 10:46:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:00,937 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 1646 transitions. [2018-09-30 10:46:00,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:46:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1646 transitions. [2018-09-30 10:46:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:46:00,938 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:00,938 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:00,938 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:00,939 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:00,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1614386347, now seen corresponding path program 1 times [2018-09-30 10:46:00,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:00,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:00,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:00,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:00,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:01,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:46:01,065 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:46:01,065 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-09-30 10:46:01,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:01,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:46:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:01,304 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:46:01,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-09-30 10:46:01,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 10:46:01,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 10:46:01,304 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:01,304 INFO L87 Difference]: Start difference. First operand 1013 states and 1646 transitions. Second operand 20 states. [2018-09-30 10:46:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:11,396 INFO L93 Difference]: Finished difference Result 2738 states and 4441 transitions. [2018-09-30 10:46:11,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-30 10:46:11,396 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-09-30 10:46:11,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:11,398 INFO L225 Difference]: With dead ends: 2738 [2018-09-30 10:46:11,398 INFO L226 Difference]: Without dead ends: 1726 [2018-09-30 10:46:11,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-09-30 10:46:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1481. [2018-09-30 10:46:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-09-30 10:46:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2418 transitions. [2018-09-30 10:46:11,744 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2418 transitions. Word has length 21 [2018-09-30 10:46:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:11,744 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2418 transitions. [2018-09-30 10:46:11,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 10:46:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2418 transitions. [2018-09-30 10:46:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:46:11,745 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:11,745 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:11,745 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:11,745 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:11,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1615679213, now seen corresponding path program 1 times [2018-09-30 10:46:11,745 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:11,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:11,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:11,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:11,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:11,869 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:46:11,869 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-09-30 10:46:11,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:11,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:46:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:12,587 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:46:12,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-30 10:46:12,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 10:46:12,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 10:46:12,588 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:12,588 INFO L87 Difference]: Start difference. First operand 1481 states and 2418 transitions. Second operand 20 states. [2018-09-30 10:46:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:25,396 INFO L93 Difference]: Finished difference Result 2759 states and 4491 transitions. [2018-09-30 10:46:25,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-30 10:46:25,396 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-09-30 10:46:25,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:25,399 INFO L225 Difference]: With dead ends: 2759 [2018-09-30 10:46:25,399 INFO L226 Difference]: Without dead ends: 2757 [2018-09-30 10:46:25,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:25,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2018-09-30 10:46:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 1886. [2018-09-30 10:46:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2018-09-30 10:46:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 3096 transitions. [2018-09-30 10:46:25,887 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 3096 transitions. Word has length 21 [2018-09-30 10:46:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:25,887 INFO L480 AbstractCegarLoop]: Abstraction has 1886 states and 3096 transitions. [2018-09-30 10:46:25,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 10:46:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 3096 transitions. [2018-09-30 10:46:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:46:25,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:25,888 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:25,888 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:25,888 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:25,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1336385522, now seen corresponding path program 1 times [2018-09-30 10:46:25,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:25,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:25,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:25,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:25,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:26,369 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:46:26,369 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-09-30 10:46:26,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:26,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:46:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:26,579 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:46:26,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-09-30 10:46:26,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:46:26,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:46:26,580 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:26,580 INFO L87 Difference]: Start difference. First operand 1886 states and 3096 transitions. Second operand 18 states. [2018-09-30 10:46:36,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:36,184 INFO L93 Difference]: Finished difference Result 2657 states and 4320 transitions. [2018-09-30 10:46:36,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 10:46:36,184 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-09-30 10:46:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:36,187 INFO L225 Difference]: With dead ends: 2657 [2018-09-30 10:46:36,187 INFO L226 Difference]: Without dead ends: 2655 [2018-09-30 10:46:36,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2018-09-30 10:46:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 1726. [2018-09-30 10:46:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2018-09-30 10:46:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2827 transitions. [2018-09-30 10:46:36,659 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2827 transitions. Word has length 21 [2018-09-30 10:46:36,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:36,659 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 2827 transitions. [2018-09-30 10:46:36,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:46:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2827 transitions. [2018-09-30 10:46:36,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:46:36,660 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:36,660 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:36,660 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:36,660 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:36,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1327798635, now seen corresponding path program 1 times [2018-09-30 10:46:36,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:36,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:36,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:36,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:36,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:36,755 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:46:36,755 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-09-30 10:46:36,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:36,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:46:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:36,996 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:46:36,996 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-09-30 10:46:36,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 10:46:36,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 10:46:36,997 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:36,997 INFO L87 Difference]: Start difference. First operand 1726 states and 2827 transitions. Second operand 19 states. [2018-09-30 10:46:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:48,807 INFO L93 Difference]: Finished difference Result 2434 states and 3937 transitions. [2018-09-30 10:46:48,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 10:46:48,807 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-09-30 10:46:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:48,809 INFO L225 Difference]: With dead ends: 2434 [2018-09-30 10:46:48,810 INFO L226 Difference]: Without dead ends: 2432 [2018-09-30 10:46:48,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2018-09-30 10:46:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 1872. [2018-09-30 10:46:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1872 states. [2018-09-30 10:46:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3060 transitions. [2018-09-30 10:46:49,747 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3060 transitions. Word has length 21 [2018-09-30 10:46:49,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:49,747 INFO L480 AbstractCegarLoop]: Abstraction has 1872 states and 3060 transitions. [2018-09-30 10:46:49,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 10:46:49,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3060 transitions. [2018-09-30 10:46:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:46:49,749 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:49,749 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:49,749 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:49,749 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:49,750 INFO L82 PathProgramCache]: Analyzing trace with hash 133649308, now seen corresponding path program 2 times [2018-09-30 10:46:49,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:49,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:49,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:49,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:50,483 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:46:50,483 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:46:50,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:46:50,502 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:46:50,502 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:46:50,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:46:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:46:50,606 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:46:50,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-09-30 10:46:50,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:46:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:46:50,606 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:50,606 INFO L87 Difference]: Start difference. First operand 1872 states and 3060 transitions. Second operand 16 states. Received shutdown request... [2018-09-30 10:46:53,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:46:53,374 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:46:53,385 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:46:53,385 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:46:53 BoogieIcfgContainer [2018-09-30 10:46:53,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:46:53,387 INFO L168 Benchmark]: Toolchain (without parser) took 244485.28 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -161.5 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 299.0 MB). Peak memory consumption was 137.5 MB. Max. memory is 7.1 GB. [2018-09-30 10:46:53,389 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-09-30 10:46:53,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.92 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-09-30 10:46:53,390 INFO L168 Benchmark]: Boogie Preprocessor took 24.68 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-09-30 10:46:53,390 INFO L168 Benchmark]: RCFGBuilder took 500.80 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-09-30 10:46:53,391 INFO L168 Benchmark]: TraceAbstraction took 243912.06 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -161.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 277.9 MB). Peak memory consumption was 116.4 MB. Max. memory is 7.1 GB. [2018-09-30 10:46:53,396 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.20 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 40.92 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 24.68 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 500.80 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 243912.06 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -161.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 277.9 MB). Peak memory consumption was 116.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 85). Cancelled while BasicCegarLoop was constructing difference of abstraction (1872states) and FLOYD_HOARE automaton (currently 25 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (1872states) and FLOYD_HOARE automaton (currently 25 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 74). Cancelled while BasicCegarLoop was constructing difference of abstraction (1872states) and FLOYD_HOARE automaton (currently 25 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 94). Cancelled while BasicCegarLoop was constructing difference of abstraction (1872states) and FLOYD_HOARE automaton (currently 25 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 4 error locations. TIMEOUT Result, 243.8s OverallTime, 50 OverallIterations, 3 TraceHistogramMax, 214.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1933 SDtfs, 8551 SDslu, 5997 SDs, 0 SdLazy, 37821 SolverSat, 4294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2126 GetRequests, 409 SyntacticMatches, 1 SemanticMatches, 1716 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1886occurred in iteration=47, 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: 9.9s AutomataMinimizationTime, 49 MinimizatonAttempts, 10960 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 1319 NumberOfCodeBlocks, 1319 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 1226 ConstructedInterpolants, 137 QuantifiedInterpolants, 126562 SizeOfPredicates, 201 NumberOfNonLiveVariables, 1841 ConjunctsInSsa, 397 ConjunctsInUnsatCore, 93 InterpolantComputations, 14 PerfectInterpolantSequences, 122/484 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.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-46-53-416.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-46-53-416.csv Completed graceful shutdown