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.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:54:54,698 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:54:54,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:54:54,712 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:54:54,712 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:54:54,713 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:54:54,714 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:54:54,716 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:54:54,718 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:54:54,719 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:54:54,719 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:54:54,720 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:54:54,721 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:54:54,722 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:54:54,723 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:54:54,723 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:54:54,724 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:54:54,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:54:54,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:54:54,729 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:54:54,730 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:54:54,731 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:54:54,733 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:54:54,734 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:54:54,734 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:54:54,735 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:54:54,736 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:54:54,736 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:54:54,737 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:54:54,738 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:54:54,738 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:54:54,739 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:54:54,739 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:54:54,740 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:54:54,741 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:54:54,741 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:54:54,741 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:54:54,764 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:54:54,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:54:54,765 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:54:54,765 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:54:54,766 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:54:54,766 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:54:54,766 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:54:54,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:54:54,767 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:54:54,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:54:54,768 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:54:54,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:54:54,768 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:54:54,768 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:54:54,768 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:54:54,769 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:54:54,769 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:54:54,769 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:54:54,769 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:54:54,769 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:54:54,770 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:54:54,770 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:54:54,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:54:54,770 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:54:54,771 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:54:54,772 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:54:54,772 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:54:54,772 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:54:54,772 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:54:54,772 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:54:54,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:54:54,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:54:54,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:54:54,854 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:54:54,855 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:54:54,856 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2018-10-02 11:54:54,856 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2018-10-02 11:54:54,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:54:54,923 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:54:54,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:54:54,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:54:54,924 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:54:54,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:54:54" (1/1) ... [2018-10-02 11:54:54,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:54:54" (1/1) ... [2018-10-02 11:54:54,964 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 11:54:54,964 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 11:54:54,964 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 11:54:54,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:54:54,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:54:54,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:54:54,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:54:54,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:54:54" (1/1) ... [2018-10-02 11:54:54,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:54:54" (1/1) ... [2018-10-02 11:54:54,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:54:54" (1/1) ... [2018-10-02 11:54:54,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:54:54" (1/1) ... [2018-10-02 11:54:54,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:54:54" (1/1) ... [2018-10-02 11:54:55,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:54:54" (1/1) ... [2018-10-02 11:54:55,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:54:54" (1/1) ... [2018-10-02 11:54:55,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:54:55,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:54:55,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:54:55,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:54:55,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:54:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:54:55,080 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-02 11:54:55,081 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-02 11:54:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-10-02 11:54:55,378 INFO L337 CfgBuilder]: Using library mode [2018-10-02 11:54:55,379 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:54:55 BoogieIcfgContainer [2018-10-02 11:54:55,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:54:55,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:54:55,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:54:55,388 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:54:55,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:54:54" (1/2) ... [2018-10-02 11:54:55,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d640b4 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:54:55, skipping insertion in model container [2018-10-02 11:54:55,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:54:55" (2/2) ... [2018-10-02 11:54:55,395 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2018-10-02 11:54:55,413 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:54:55,421 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:54:55,510 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:54:55,513 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:54:55,514 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:54:55,514 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:54:55,514 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:54:55,514 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:54:55,514 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:54:55,515 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:54:55,515 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:54:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-10-02 11:54:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 11:54:55,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:54:55,544 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-02 11:54:55,546 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:54:55,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:54:55,553 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-10-02 11:54:55,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:54:55,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:54:55,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:55,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:54:55,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:55,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:54:55,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-02 11:54:55,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:54:55,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:54:55,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:54:55,804 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-10-02 11:54:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:54:55,866 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-10-02 11:54:55,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:54:55,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-02 11:54:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:54:55,880 INFO L225 Difference]: With dead ends: 17 [2018-10-02 11:54:55,881 INFO L226 Difference]: Without dead ends: 10 [2018-10-02 11:54:55,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:54:55,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-02 11:54:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-10-02 11:54:55,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-02 11:54:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-02 11:54:55,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-10-02 11:54:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:54:55,915 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-02 11:54:55,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:54:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-02 11:54:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:54:55,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:54:55,916 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-02 11:54:55,916 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:54:55,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:54:55,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-10-02 11:54:55,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:54:55,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:54:55,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:55,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:54:55,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:56,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:54:56,100 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) [2018-10-02 11:54:56,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:54:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:56,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:54:56,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:54:56,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:54:56,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:54:56,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:54:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:56,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:54:56,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-10-02 11:54:56,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 11:54:56,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 11:54:56,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:54:56,475 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-10-02 11:54:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:54:56,578 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-02 11:54:56,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:54:56,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-10-02 11:54:56,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:54:56,580 INFO L225 Difference]: With dead ends: 15 [2018-10-02 11:54:56,580 INFO L226 Difference]: Without dead ends: 14 [2018-10-02 11:54:56,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:54:56,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-02 11:54:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-10-02 11:54:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-02 11:54:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-02 11:54:56,586 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-10-02 11:54:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:54:56,586 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-02 11:54:56,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 11:54:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-02 11:54:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:54:56,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:54:56,588 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-10-02 11:54:56,588 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:54:56,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:54:56,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-10-02 11:54:56,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:54:56,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:54:56,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:56,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:54:56,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:56,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:54:56,760 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:54:56,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:54:56,816 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:54:56,816 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:54:56,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:54:56,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:54:56,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:54:56,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:54:56,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:54:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:57,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:54:57,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-10-02 11:54:57,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:54:57,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:54:57,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:54:57,172 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-10-02 11:54:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:54:57,252 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-02 11:54:57,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:54:57,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:54:57,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:54:57,254 INFO L225 Difference]: With dead ends: 19 [2018-10-02 11:54:57,254 INFO L226 Difference]: Without dead ends: 18 [2018-10-02 11:54:57,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:54:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-02 11:54:57,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-10-02 11:54:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-02 11:54:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-02 11:54:57,260 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-10-02 11:54:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:54:57,260 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-02 11:54:57,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:54:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-02 11:54:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:54:57,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:54:57,262 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-10-02 11:54:57,262 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:54:57,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:54:57,264 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-10-02 11:54:57,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:54:57,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:54:57,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:57,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:54:57,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:57,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:54:57,442 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:54:57,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:54:57,509 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-02 11:54:57,509 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:54:57,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:54:57,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:54:57,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:54:57,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:54:57,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:54:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:57,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:54:57,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-02 11:54:57,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:54:57,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:54:57,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:54:57,776 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-10-02 11:54:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:54:57,840 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-02 11:54:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:54:57,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-10-02 11:54:57,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:54:57,842 INFO L225 Difference]: With dead ends: 23 [2018-10-02 11:54:57,842 INFO L226 Difference]: Without dead ends: 22 [2018-10-02 11:54:57,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:54:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-02 11:54:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-10-02 11:54:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-02 11:54:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-02 11:54:57,848 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-10-02 11:54:57,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:54:57,849 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-02 11:54:57,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:54:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-02 11:54:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 11:54:57,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:54:57,850 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-10-02 11:54:57,850 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:54:57,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:54:57,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-10-02 11:54:57,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:54:57,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:54:57,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:57,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:54:57,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:57,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:54:57,978 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:54:57,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:54:58,007 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:54:58,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:54:58,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:54:58,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:54:58,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:54:58,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:54:58,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:54:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:58,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:54:58,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-10-02 11:54:58,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:54:58,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:54:58,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:54:58,209 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-10-02 11:54:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:54:58,315 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-02 11:54:58,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 11:54:58,315 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-10-02 11:54:58,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:54:58,316 INFO L225 Difference]: With dead ends: 27 [2018-10-02 11:54:58,316 INFO L226 Difference]: Without dead ends: 26 [2018-10-02 11:54:58,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:54:58,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-02 11:54:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-02 11:54:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-02 11:54:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-02 11:54:58,325 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-10-02 11:54:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:54:58,325 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-02 11:54:58,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:54:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-02 11:54:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 11:54:58,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:54:58,326 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-10-02 11:54:58,328 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:54:58,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:54:58,328 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-10-02 11:54:58,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:54:58,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:54:58,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:58,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:54:58,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:58,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:54:58,520 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:54:58,528 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:54:58,618 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-02 11:54:58,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:54:58,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:54:58,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:54:58,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:54:58,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:54:58,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:54:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:59,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:54:59,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-02 11:54:59,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:54:59,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:54:59,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:54:59,024 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-10-02 11:54:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:54:59,088 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-02 11:54:59,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 11:54:59,093 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-10-02 11:54:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:54:59,094 INFO L225 Difference]: With dead ends: 31 [2018-10-02 11:54:59,094 INFO L226 Difference]: Without dead ends: 30 [2018-10-02 11:54:59,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:54:59,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-02 11:54:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-02 11:54:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-02 11:54:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-02 11:54:59,099 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-10-02 11:54:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:54:59,100 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-02 11:54:59,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:54:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-02 11:54:59,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-02 11:54:59,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:54:59,101 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-10-02 11:54:59,101 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:54:59,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:54:59,102 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-10-02 11:54:59,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:54:59,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:54:59,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:59,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:54:59,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:59,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:54:59,339 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:54:59,347 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:54:59,367 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-02 11:54:59,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:54:59,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:54:59,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:54:59,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:54:59,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:54:59,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:54:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:59,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:54:59,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-02 11:54:59,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:54:59,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:54:59,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:54:59,638 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-10-02 11:54:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:54:59,724 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-02 11:54:59,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:54:59,725 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-10-02 11:54:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:54:59,727 INFO L225 Difference]: With dead ends: 35 [2018-10-02 11:54:59,727 INFO L226 Difference]: Without dead ends: 34 [2018-10-02 11:54:59,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:54:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-02 11:54:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-02 11:54:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-02 11:54:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-02 11:54:59,734 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-10-02 11:54:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:54:59,735 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-02 11:54:59,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:54:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-02 11:54:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-02 11:54:59,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:54:59,736 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-10-02 11:54:59,736 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:54:59,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:54:59,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-10-02 11:54:59,737 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:54:59,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:54:59,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:59,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:54:59,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:59,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:54:59,960 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:54:59,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:54:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:59,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:00,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:00,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:00,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:00,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:00,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:00,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-10-02 11:55:00,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:55:00,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:55:00,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:55:00,233 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-10-02 11:55:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:00,458 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-02 11:55:00,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 11:55:00,459 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-10-02 11:55:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:00,460 INFO L225 Difference]: With dead ends: 39 [2018-10-02 11:55:00,460 INFO L226 Difference]: Without dead ends: 38 [2018-10-02 11:55:00,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:55:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-02 11:55:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-10-02 11:55:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-02 11:55:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-02 11:55:00,466 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-10-02 11:55:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:00,466 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-02 11:55:00,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:55:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-02 11:55:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-02 11:55:00,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:00,468 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-10-02 11:55:00,468 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:00,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:00,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-10-02 11:55:00,469 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:00,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:00,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:00,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:00,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:00,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:00,634 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-02 11:55:00,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:55:00,658 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:55:00,658 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:00,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:00,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:00,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:00,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:00,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:00,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:00,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-10-02 11:55:00,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 11:55:00,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 11:55:00,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:55:00,903 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-10-02 11:55:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:00,998 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-02 11:55:00,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:55:00,998 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-10-02 11:55:00,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:00,999 INFO L225 Difference]: With dead ends: 43 [2018-10-02 11:55:01,000 INFO L226 Difference]: Without dead ends: 42 [2018-10-02 11:55:01,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:55:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-02 11:55:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-10-02 11:55:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-02 11:55:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-02 11:55:01,006 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-10-02 11:55:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:01,006 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-02 11:55:01,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 11:55:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-02 11:55:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-02 11:55:01,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:01,008 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-10-02 11:55:01,008 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:01,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:01,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-10-02 11:55:01,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:01,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:01,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:01,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:01,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:01,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:01,621 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:01,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:55:01,666 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-02 11:55:01,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:01,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:01,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:01,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:01,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:01,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:02,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:02,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-10-02 11:55:02,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-02 11:55:02,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-02 11:55:02,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:55:02,078 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-10-02 11:55:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:02,190 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-02 11:55:02,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:55:02,191 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-10-02 11:55:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:02,192 INFO L225 Difference]: With dead ends: 47 [2018-10-02 11:55:02,192 INFO L226 Difference]: Without dead ends: 46 [2018-10-02 11:55:02,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:55:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-02 11:55:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-02 11:55:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-02 11:55:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-02 11:55:02,200 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-10-02 11:55:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:02,200 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-02 11:55:02,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-02 11:55:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-02 11:55:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-02 11:55:02,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:02,202 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-10-02 11:55:02,202 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:02,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:02,202 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-10-02 11:55:02,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:02,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:02,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:02,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:02,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:02,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:02,486 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:02,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:55:02,521 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:55:02,521 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:02,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:02,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:02,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:02,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:02,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:02,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:02,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-10-02 11:55:02,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-02 11:55:02,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-02 11:55:02,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-02 11:55:02,859 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-10-02 11:55:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:02,974 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-02 11:55:02,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:55:02,975 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-10-02 11:55:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:02,977 INFO L225 Difference]: With dead ends: 51 [2018-10-02 11:55:02,978 INFO L226 Difference]: Without dead ends: 50 [2018-10-02 11:55:02,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-02 11:55:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-02 11:55:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-02 11:55:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-02 11:55:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-02 11:55:02,983 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-10-02 11:55:02,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:02,983 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-02 11:55:02,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-02 11:55:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-02 11:55:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-02 11:55:02,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:02,985 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-10-02 11:55:02,985 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:02,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:02,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-10-02 11:55:02,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:02,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:02,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:02,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:02,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:03,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:03,231 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:03,240 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:55:03,266 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-02 11:55:03,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:03,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:03,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:03,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:03,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:03,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:03,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:03,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-10-02 11:55:03,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-02 11:55:03,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-02 11:55:03,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:55:03,760 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-10-02 11:55:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:03,870 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-02 11:55:03,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:55:03,871 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-10-02 11:55:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:03,872 INFO L225 Difference]: With dead ends: 55 [2018-10-02 11:55:03,872 INFO L226 Difference]: Without dead ends: 54 [2018-10-02 11:55:03,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:55:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-02 11:55:03,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-02 11:55:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-02 11:55:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-02 11:55:03,879 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-10-02 11:55:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:03,879 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-02 11:55:03,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-02 11:55:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-02 11:55:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-02 11:55:03,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:03,880 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-10-02 11:55:03,881 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:03,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:03,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-10-02 11:55:03,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:03,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:03,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:03,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:03,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:04,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:04,271 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:04,280 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:55:04,309 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-02 11:55:04,310 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:04,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:04,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:04,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:04,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:04,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:04,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:04,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-10-02 11:55:04,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-02 11:55:04,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-02 11:55:04,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-02 11:55:04,591 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-10-02 11:55:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:04,913 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-02 11:55:04,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:55:04,914 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-10-02 11:55:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:04,915 INFO L225 Difference]: With dead ends: 59 [2018-10-02 11:55:04,915 INFO L226 Difference]: Without dead ends: 58 [2018-10-02 11:55:04,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-02 11:55:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-02 11:55:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-02 11:55:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-02 11:55:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-02 11:55:04,928 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-10-02 11:55:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:04,929 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-02 11:55:04,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-02 11:55:04,929 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-02 11:55:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-02 11:55:04,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:04,930 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-10-02 11:55:04,930 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:04,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-10-02 11:55:04,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:04,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:04,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:05,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:05,258 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:05,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:05,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:05,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:05,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:05,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:05,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:05,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:05,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-10-02 11:55:05,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-02 11:55:05,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-02 11:55:05,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-02 11:55:05,634 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-10-02 11:55:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:05,909 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-02 11:55:05,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:55:05,909 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-10-02 11:55:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:05,910 INFO L225 Difference]: With dead ends: 63 [2018-10-02 11:55:05,910 INFO L226 Difference]: Without dead ends: 62 [2018-10-02 11:55:05,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-02 11:55:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-02 11:55:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-02 11:55:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-02 11:55:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-02 11:55:05,916 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-10-02 11:55:05,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:05,917 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-02 11:55:05,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-02 11:55:05,917 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-02 11:55:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-02 11:55:05,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:05,918 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-10-02 11:55:05,919 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:05,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:05,919 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-10-02 11:55:05,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:05,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:05,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:05,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:05,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:06,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:06,772 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:06,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:55:06,808 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:55:06,809 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:06,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:06,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:06,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:06,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:06,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:07,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:07,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-10-02 11:55:07,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-02 11:55:07,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-02 11:55:07,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-02 11:55:07,080 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-10-02 11:55:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:07,222 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-02 11:55:07,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:55:07,222 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-10-02 11:55:07,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:07,223 INFO L225 Difference]: With dead ends: 67 [2018-10-02 11:55:07,223 INFO L226 Difference]: Without dead ends: 66 [2018-10-02 11:55:07,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-02 11:55:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-02 11:55:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-10-02 11:55:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-02 11:55:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-02 11:55:07,230 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-10-02 11:55:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:07,231 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-02 11:55:07,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-02 11:55:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-02 11:55:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-02 11:55:07,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:07,232 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-10-02 11:55:07,232 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:07,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:07,233 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-10-02 11:55:07,233 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:07,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:07,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:07,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:07,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:07,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:07,900 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:07,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:55:07,953 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-02 11:55:07,953 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:07,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:07,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:07,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:07,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:07,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:08,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:08,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-10-02 11:55:08,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-02 11:55:08,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-02 11:55:08,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:55:08,290 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-10-02 11:55:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:08,568 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-02 11:55:08,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:55:08,569 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-10-02 11:55:08,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:08,569 INFO L225 Difference]: With dead ends: 71 [2018-10-02 11:55:08,569 INFO L226 Difference]: Without dead ends: 70 [2018-10-02 11:55:08,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:55:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-02 11:55:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-02 11:55:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-02 11:55:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-02 11:55:08,576 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-10-02 11:55:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:08,576 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-02 11:55:08,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-02 11:55:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-02 11:55:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-02 11:55:08,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:08,581 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-10-02 11:55:08,581 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:08,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:08,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-10-02 11:55:08,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:08,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:08,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:08,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:08,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:08,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:08,933 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:08,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:55:08,961 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:55:08,961 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:08,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:08,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:08,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:09,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:09,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:09,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:09,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-10-02 11:55:09,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-02 11:55:09,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-02 11:55:09,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-02 11:55:09,445 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-10-02 11:55:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:09,589 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-02 11:55:09,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 11:55:09,589 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-10-02 11:55:09,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:09,590 INFO L225 Difference]: With dead ends: 75 [2018-10-02 11:55:09,590 INFO L226 Difference]: Without dead ends: 74 [2018-10-02 11:55:09,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-02 11:55:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-02 11:55:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-10-02 11:55:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-02 11:55:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-02 11:55:09,596 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-10-02 11:55:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:09,597 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-02 11:55:09,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-02 11:55:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-02 11:55:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-02 11:55:09,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:09,598 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-10-02 11:55:09,598 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:09,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-10-02 11:55:09,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:09,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:09,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:09,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:10,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:10,507 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:10,515 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:55:10,551 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-02 11:55:10,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:10,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:10,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:10,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:10,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:10,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:10,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:10,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-10-02 11:55:10,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-02 11:55:10,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-02 11:55:10,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-02 11:55:10,906 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-10-02 11:55:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:11,010 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-02 11:55:11,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 11:55:11,011 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-10-02 11:55:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:11,012 INFO L225 Difference]: With dead ends: 79 [2018-10-02 11:55:11,012 INFO L226 Difference]: Without dead ends: 78 [2018-10-02 11:55:11,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-02 11:55:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-02 11:55:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-10-02 11:55:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-02 11:55:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-02 11:55:11,019 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-10-02 11:55:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:11,020 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-02 11:55:11,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-02 11:55:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-02 11:55:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-02 11:55:11,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:11,021 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-10-02 11:55:11,022 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:11,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-10-02 11:55:11,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:11,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:11,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:11,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:11,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:11,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:11,311 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:11,318 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:55:11,367 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-02 11:55:11,367 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:11,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:11,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:11,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:11,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:11,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:11,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:11,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-10-02 11:55:11,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-02 11:55:11,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-02 11:55:11,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-02 11:55:11,837 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-10-02 11:55:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:11,949 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-02 11:55:11,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:55:11,950 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-10-02 11:55:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:11,951 INFO L225 Difference]: With dead ends: 83 [2018-10-02 11:55:11,951 INFO L226 Difference]: Without dead ends: 82 [2018-10-02 11:55:11,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-02 11:55:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-02 11:55:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-02 11:55:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-02 11:55:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-02 11:55:11,955 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-10-02 11:55:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:11,955 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-02 11:55:11,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-02 11:55:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-02 11:55:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-02 11:55:11,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:11,957 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-10-02 11:55:11,957 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:11,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:11,957 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-10-02 11:55:11,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:11,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:11,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:11,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:11,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:12,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:12,305 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:12,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:12,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:12,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:12,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:12,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:12,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:12,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:12,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-10-02 11:55:12,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-02 11:55:12,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-02 11:55:12,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-02 11:55:12,902 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-10-02 11:55:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:13,125 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-02 11:55:13,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 11:55:13,125 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-10-02 11:55:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:13,127 INFO L225 Difference]: With dead ends: 87 [2018-10-02 11:55:13,127 INFO L226 Difference]: Without dead ends: 86 [2018-10-02 11:55:13,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-02 11:55:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-02 11:55:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-10-02 11:55:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-02 11:55:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-02 11:55:13,133 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-10-02 11:55:13,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:13,133 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-02 11:55:13,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-02 11:55:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-02 11:55:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-02 11:55:13,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:13,134 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-10-02 11:55:13,135 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:13,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:13,135 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-10-02 11:55:13,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:13,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:13,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:13,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:13,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:13,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:13,704 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:13,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:55:13,739 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:55:13,739 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:13,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:13,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:13,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:13,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:13,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:14,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:14,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-10-02 11:55:14,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-02 11:55:14,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-02 11:55:14,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-02 11:55:14,136 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-10-02 11:55:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:14,295 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-02 11:55:14,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:55:14,295 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-10-02 11:55:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:14,296 INFO L225 Difference]: With dead ends: 91 [2018-10-02 11:55:14,297 INFO L226 Difference]: Without dead ends: 90 [2018-10-02 11:55:14,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-02 11:55:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-02 11:55:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-10-02 11:55:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-02 11:55:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-02 11:55:14,302 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-10-02 11:55:14,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:14,302 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-02 11:55:14,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-02 11:55:14,302 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-02 11:55:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-02 11:55:14,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:14,303 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-10-02 11:55:14,304 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:14,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:14,304 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-10-02 11:55:14,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:14,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:14,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:14,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:14,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:14,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:14,747 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:14,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:55:14,806 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-02 11:55:14,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:14,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:14,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:14,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:14,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:14,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:16,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:16,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-10-02 11:55:16,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-02 11:55:16,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-02 11:55:16,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-02 11:55:16,758 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-10-02 11:55:16,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:16,910 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-02 11:55:16,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:55:16,911 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-10-02 11:55:16,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:16,912 INFO L225 Difference]: With dead ends: 95 [2018-10-02 11:55:16,912 INFO L226 Difference]: Without dead ends: 94 [2018-10-02 11:55:16,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-02 11:55:16,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-02 11:55:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-10-02 11:55:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-02 11:55:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-02 11:55:16,917 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-10-02 11:55:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:16,917 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-02 11:55:16,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-02 11:55:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-02 11:55:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-02 11:55:16,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:16,918 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-10-02 11:55:16,918 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:16,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:16,918 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-10-02 11:55:16,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:16,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:16,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:16,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:17,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:17,292 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:17,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:55:17,338 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:55:17,339 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:17,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:17,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:17,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:17,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:17,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:17,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:17,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-10-02 11:55:17,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-02 11:55:17,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-02 11:55:17,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-02 11:55:17,804 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-10-02 11:55:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:17,964 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-02 11:55:17,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 11:55:17,964 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-10-02 11:55:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:17,965 INFO L225 Difference]: With dead ends: 99 [2018-10-02 11:55:17,965 INFO L226 Difference]: Without dead ends: 98 [2018-10-02 11:55:17,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-02 11:55:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-02 11:55:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-10-02 11:55:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-02 11:55:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-02 11:55:17,971 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-10-02 11:55:17,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:17,971 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-02 11:55:17,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-02 11:55:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-02 11:55:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-02 11:55:17,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:17,972 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-10-02 11:55:17,972 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:17,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:17,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-10-02 11:55:17,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:17,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:17,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:17,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:17,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:18,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:18,376 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:18,384 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:55:18,440 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-02 11:55:18,440 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:18,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:18,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:18,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:18,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:18,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:19,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:19,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-10-02 11:55:19,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-02 11:55:19,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-02 11:55:19,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-02 11:55:19,156 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-10-02 11:55:19,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:19,409 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-02 11:55:19,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-02 11:55:19,409 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-10-02 11:55:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:19,411 INFO L225 Difference]: With dead ends: 103 [2018-10-02 11:55:19,411 INFO L226 Difference]: Without dead ends: 102 [2018-10-02 11:55:19,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-02 11:55:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-02 11:55:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-10-02 11:55:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-02 11:55:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-02 11:55:19,417 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-10-02 11:55:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:19,417 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-02 11:55:19,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-02 11:55:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-02 11:55:19,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-02 11:55:19,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:19,418 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-10-02 11:55:19,418 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:19,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:19,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-10-02 11:55:19,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:19,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:19,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:19,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:19,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:19,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:19,961 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:19,968 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:55:20,037 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-02 11:55:20,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:20,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:20,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:20,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:20,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:20,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:20,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:20,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-10-02 11:55:20,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-02 11:55:20,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-02 11:55:20,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-02 11:55:20,737 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-10-02 11:55:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:20,937 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-02 11:55:20,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:55:20,937 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-10-02 11:55:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:20,938 INFO L225 Difference]: With dead ends: 107 [2018-10-02 11:55:20,938 INFO L226 Difference]: Without dead ends: 106 [2018-10-02 11:55:20,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-02 11:55:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-02 11:55:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-02 11:55:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-02 11:55:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-02 11:55:20,942 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-10-02 11:55:20,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:20,943 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-02 11:55:20,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-02 11:55:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-02 11:55:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-02 11:55:20,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:20,944 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-10-02 11:55:20,944 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:20,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-10-02 11:55:20,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:20,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:20,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:20,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:20,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:21,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:21,981 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:21,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:22,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:22,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:22,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:22,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:22,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:22,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:22,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-10-02 11:55:22,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-02 11:55:22,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-02 11:55:22,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-02 11:55:22,801 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-10-02 11:55:23,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:23,001 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-02 11:55:23,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 11:55:23,001 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-10-02 11:55:23,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:23,002 INFO L225 Difference]: With dead ends: 111 [2018-10-02 11:55:23,003 INFO L226 Difference]: Without dead ends: 110 [2018-10-02 11:55:23,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-02 11:55:23,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-02 11:55:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-10-02 11:55:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-02 11:55:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-02 11:55:23,008 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-10-02 11:55:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:23,008 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-02 11:55:23,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-02 11:55:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-02 11:55:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-02 11:55:23,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:23,009 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-10-02 11:55:23,009 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:23,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:23,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-10-02 11:55:23,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:23,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:23,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:23,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:23,562 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:23,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:55:23,599 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:55:23,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:23,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:23,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:23,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:23,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:23,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:24,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:24,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-10-02 11:55:24,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-02 11:55:24,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-02 11:55:24,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-02 11:55:24,209 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-10-02 11:55:24,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:24,421 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-02 11:55:24,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 11:55:24,421 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-10-02 11:55:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:24,423 INFO L225 Difference]: With dead ends: 115 [2018-10-02 11:55:24,423 INFO L226 Difference]: Without dead ends: 114 [2018-10-02 11:55:24,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-02 11:55:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-02 11:55:24,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-10-02 11:55:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-02 11:55:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-02 11:55:24,429 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-10-02 11:55:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:24,429 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-02 11:55:24,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-02 11:55:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-02 11:55:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-02 11:55:24,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:24,430 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-10-02 11:55:24,431 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:24,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:24,431 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-10-02 11:55:24,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:24,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:24,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:24,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:24,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:24,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:24,976 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:24,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:55:25,068 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-02 11:55:25,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:25,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:25,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:25,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:25,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:25,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:26,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:26,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-10-02 11:55:26,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-02 11:55:26,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-02 11:55:26,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-02 11:55:26,030 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-10-02 11:55:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:26,229 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-02 11:55:26,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 11:55:26,229 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-10-02 11:55:26,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:26,231 INFO L225 Difference]: With dead ends: 119 [2018-10-02 11:55:26,231 INFO L226 Difference]: Without dead ends: 118 [2018-10-02 11:55:26,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-02 11:55:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-02 11:55:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-10-02 11:55:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-02 11:55:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-02 11:55:26,236 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-10-02 11:55:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:26,236 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-02 11:55:26,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-02 11:55:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-02 11:55:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-02 11:55:26,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:26,237 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-10-02 11:55:26,238 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:26,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:26,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-10-02 11:55:26,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:26,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:26,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:26,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:26,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:26,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:26,840 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:26,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:55:26,886 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:55:26,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:26,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:26,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:26,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:26,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:26,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:27,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:27,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-10-02 11:55:27,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-02 11:55:27,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-02 11:55:27,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-02 11:55:27,585 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-10-02 11:55:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:27,798 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-02 11:55:27,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-02 11:55:27,798 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-10-02 11:55:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:27,800 INFO L225 Difference]: With dead ends: 123 [2018-10-02 11:55:27,800 INFO L226 Difference]: Without dead ends: 122 [2018-10-02 11:55:27,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-02 11:55:27,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-02 11:55:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-10-02 11:55:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-02 11:55:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-02 11:55:27,806 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-10-02 11:55:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:27,806 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-02 11:55:27,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-02 11:55:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-02 11:55:27,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-02 11:55:27,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:27,807 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-10-02 11:55:27,807 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:27,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:27,808 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-10-02 11:55:27,808 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:27,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:27,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:27,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:27,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:28,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:28,401 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:28,411 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:55:28,484 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-02 11:55:28,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:28,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:28,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:28,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:28,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:28,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:29,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:29,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-10-02 11:55:29,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-02 11:55:29,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-02 11:55:29,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-02 11:55:29,227 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-10-02 11:55:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:29,503 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-02 11:55:29,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 11:55:29,504 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-10-02 11:55:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:29,505 INFO L225 Difference]: With dead ends: 127 [2018-10-02 11:55:29,505 INFO L226 Difference]: Without dead ends: 126 [2018-10-02 11:55:29,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-02 11:55:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-02 11:55:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-10-02 11:55:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-02 11:55:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-02 11:55:29,511 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-10-02 11:55:29,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:29,511 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-02 11:55:29,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-02 11:55:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-02 11:55:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-02 11:55:29,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:29,512 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-10-02 11:55:29,512 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:29,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:29,512 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-10-02 11:55:29,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:29,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:29,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:29,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:29,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:30,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:30,920 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:30,929 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:55:31,024 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-02 11:55:31,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:31,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:31,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:31,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:31,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:31,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:31,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:31,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-10-02 11:55:31,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-02 11:55:31,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-02 11:55:31,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-02 11:55:31,762 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-10-02 11:55:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:31,970 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-02 11:55:31,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-02 11:55:31,971 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-10-02 11:55:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:31,972 INFO L225 Difference]: With dead ends: 131 [2018-10-02 11:55:31,972 INFO L226 Difference]: Without dead ends: 130 [2018-10-02 11:55:31,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-02 11:55:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-02 11:55:31,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-10-02 11:55:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-02 11:55:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-02 11:55:31,977 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-10-02 11:55:31,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:31,977 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-02 11:55:31,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-02 11:55:31,977 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-02 11:55:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-02 11:55:31,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:31,978 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-10-02 11:55:31,979 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:31,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:31,979 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-10-02 11:55:31,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:31,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:31,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:31,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:31,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:32,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:32,652 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:32,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:32,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:32,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:32,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:32,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:32,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:33,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:33,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-10-02 11:55:33,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-02 11:55:33,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-02 11:55:33,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-02 11:55:33,483 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-10-02 11:55:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:33,693 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-02 11:55:33,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 11:55:33,693 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-10-02 11:55:33,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:33,695 INFO L225 Difference]: With dead ends: 135 [2018-10-02 11:55:33,695 INFO L226 Difference]: Without dead ends: 134 [2018-10-02 11:55:33,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-02 11:55:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-02 11:55:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-10-02 11:55:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-02 11:55:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-02 11:55:33,701 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-10-02 11:55:33,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:33,701 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-02 11:55:33,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-02 11:55:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-02 11:55:33,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-02 11:55:33,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:33,702 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-10-02 11:55:33,703 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:33,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:33,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-10-02 11:55:33,703 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:33,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:33,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:33,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:33,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:34,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:34,396 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:34,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:55:34,454 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:55:34,454 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:34,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:34,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:34,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:34,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:34,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:35,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:35,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-10-02 11:55:35,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-02 11:55:35,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-02 11:55:35,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-02 11:55:35,551 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-10-02 11:55:35,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:35,858 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-02 11:55:35,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-02 11:55:35,858 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-10-02 11:55:35,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:35,859 INFO L225 Difference]: With dead ends: 139 [2018-10-02 11:55:35,859 INFO L226 Difference]: Without dead ends: 138 [2018-10-02 11:55:35,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-02 11:55:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-02 11:55:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-10-02 11:55:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-02 11:55:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-02 11:55:35,864 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-10-02 11:55:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:35,865 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-02 11:55:35,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-02 11:55:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-02 11:55:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-02 11:55:35,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:35,866 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-10-02 11:55:35,866 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:35,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:35,866 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-10-02 11:55:35,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:35,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:35,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:35,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:35,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:36,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:36,605 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:36,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:55:36,716 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-02 11:55:36,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:36,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:36,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:36,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:36,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:36,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:39,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:39,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-10-02 11:55:39,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-02 11:55:39,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-02 11:55:39,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-02 11:55:39,010 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-10-02 11:55:39,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:39,327 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-02 11:55:39,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-02 11:55:39,328 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-10-02 11:55:39,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:39,329 INFO L225 Difference]: With dead ends: 143 [2018-10-02 11:55:39,329 INFO L226 Difference]: Without dead ends: 142 [2018-10-02 11:55:39,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-02 11:55:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-02 11:55:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-10-02 11:55:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-02 11:55:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-02 11:55:39,335 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-10-02 11:55:39,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:39,335 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-02 11:55:39,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-02 11:55:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-02 11:55:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-02 11:55:39,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:39,337 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-10-02 11:55:39,337 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:39,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:39,337 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-10-02 11:55:39,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:39,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:39,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:39,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:39,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:40,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:40,066 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:40,080 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:55:40,125 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:55:40,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:40,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:40,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:40,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:40,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:40,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:41,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:41,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-10-02 11:55:41,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-02 11:55:41,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-02 11:55:41,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-02 11:55:41,297 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-10-02 11:55:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:41,767 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-02 11:55:41,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-02 11:55:41,768 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-10-02 11:55:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:41,769 INFO L225 Difference]: With dead ends: 147 [2018-10-02 11:55:41,769 INFO L226 Difference]: Without dead ends: 146 [2018-10-02 11:55:41,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-02 11:55:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-02 11:55:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-10-02 11:55:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-02 11:55:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-02 11:55:41,778 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-10-02 11:55:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:41,778 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-02 11:55:41,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-02 11:55:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-02 11:55:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-02 11:55:41,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:41,779 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-10-02 11:55:41,780 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:41,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:41,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-10-02 11:55:41,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:41,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:41,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:41,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:41,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:42,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:42,594 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:42,602 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:55:42,686 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-02 11:55:42,686 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:42,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:42,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:42,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:42,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:42,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:43,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:43,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-10-02 11:55:43,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-02 11:55:43,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-02 11:55:43,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-02 11:55:43,591 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-10-02 11:55:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:44,040 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-02 11:55:44,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-02 11:55:44,040 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-10-02 11:55:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:44,044 INFO L225 Difference]: With dead ends: 151 [2018-10-02 11:55:44,045 INFO L226 Difference]: Without dead ends: 150 [2018-10-02 11:55:44,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-02 11:55:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-02 11:55:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-10-02 11:55:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-02 11:55:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-02 11:55:44,050 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-10-02 11:55:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:44,050 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-02 11:55:44,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-02 11:55:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-02 11:55:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-02 11:55:44,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:44,051 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-10-02 11:55:44,051 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:44,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:44,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-10-02 11:55:44,052 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:44,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:44,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:44,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:44,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:44,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:44,862 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:44,871 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:55:44,982 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-02 11:55:44,982 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:44,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:45,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:45,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:45,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:45,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:46,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:46,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-10-02 11:55:46,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-02 11:55:46,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-02 11:55:46,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-02 11:55:46,180 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-10-02 11:55:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:46,484 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-02 11:55:46,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 11:55:46,484 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-10-02 11:55:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:46,486 INFO L225 Difference]: With dead ends: 155 [2018-10-02 11:55:46,486 INFO L226 Difference]: Without dead ends: 154 [2018-10-02 11:55:46,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-02 11:55:46,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-02 11:55:46,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-10-02 11:55:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-02 11:55:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-02 11:55:46,492 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-10-02 11:55:46,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:46,493 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-02 11:55:46,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-02 11:55:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-02 11:55:46,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-02 11:55:46,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:46,494 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-10-02 11:55:46,494 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:46,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:46,495 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-10-02 11:55:46,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:46,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:46,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:46,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:46,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:47,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:47,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:47,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:47,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:47,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:47,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:47,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:47,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:48,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:48,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-10-02 11:55:48,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-02 11:55:48,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-02 11:55:48,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-02 11:55:48,841 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-10-02 11:55:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:49,117 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-02 11:55:49,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-02 11:55:49,117 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-10-02 11:55:49,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:49,119 INFO L225 Difference]: With dead ends: 159 [2018-10-02 11:55:49,119 INFO L226 Difference]: Without dead ends: 158 [2018-10-02 11:55:49,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-02 11:55:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-02 11:55:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-10-02 11:55:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-02 11:55:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-02 11:55:49,125 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-10-02 11:55:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:49,125 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-02 11:55:49,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-02 11:55:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-02 11:55:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-02 11:55:49,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:49,126 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-10-02 11:55:49,127 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:49,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:49,127 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-10-02 11:55:49,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:49,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:49,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:49,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:49,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:50,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:50,269 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:50,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:55:50,325 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:55:50,325 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:50,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:50,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:50,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:50,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:50,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:51,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:51,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-10-02 11:55:51,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-02 11:55:51,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-02 11:55:51,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-02 11:55:51,677 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-10-02 11:55:51,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:51,979 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-02 11:55:51,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-02 11:55:51,980 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-10-02 11:55:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:51,981 INFO L225 Difference]: With dead ends: 163 [2018-10-02 11:55:51,981 INFO L226 Difference]: Without dead ends: 162 [2018-10-02 11:55:51,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-02 11:55:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-02 11:55:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-10-02 11:55:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-02 11:55:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-02 11:55:51,987 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-10-02 11:55:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:51,988 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-02 11:55:51,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-02 11:55:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-02 11:55:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-02 11:55:51,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:51,989 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-10-02 11:55:51,989 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:51,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:51,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-10-02 11:55:51,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:51,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:51,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:51,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:51,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:53,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:53,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:53,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:55:53,849 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-02 11:55:53,849 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:53,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:53,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:53,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:53,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:53,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:54,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:54,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-10-02 11:55:54,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-02 11:55:54,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-02 11:55:54,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-02 11:55:54,930 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-10-02 11:55:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:55,383 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-02 11:55:55,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-02 11:55:55,384 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-10-02 11:55:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:55,385 INFO L225 Difference]: With dead ends: 167 [2018-10-02 11:55:55,385 INFO L226 Difference]: Without dead ends: 166 [2018-10-02 11:55:55,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-02 11:55:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-02 11:55:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-10-02 11:55:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-02 11:55:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-02 11:55:55,393 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-10-02 11:55:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:55,394 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-02 11:55:55,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-02 11:55:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-02 11:55:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-02 11:55:55,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:55,395 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-10-02 11:55:55,395 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:55,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:55,395 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-10-02 11:55:55,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:55,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:55,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:55,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:55,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:57,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:57,159 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:57,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:55:57,217 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:55:57,218 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:57,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:57,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:57,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:57,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:57,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:58,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:58,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-10-02 11:55:58,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-02 11:55:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-02 11:55:58,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-02 11:55:58,401 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-10-02 11:55:58,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:58,663 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-02 11:55:58,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-02 11:55:58,663 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-10-02 11:55:58,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:58,664 INFO L225 Difference]: With dead ends: 171 [2018-10-02 11:55:58,664 INFO L226 Difference]: Without dead ends: 170 [2018-10-02 11:55:58,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-02 11:55:58,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-02 11:55:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-10-02 11:55:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-02 11:55:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-02 11:55:58,670 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-10-02 11:55:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:58,671 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-02 11:55:58,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-02 11:55:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-02 11:55:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-02 11:55:58,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:58,672 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-10-02 11:55:58,672 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:55:58,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:58,672 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-10-02 11:55:58,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:58,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:58,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:58,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:58,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:59,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:59,707 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:59,721 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:55:59,883 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-02 11:55:59,883 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:59,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:59,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:59,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:00,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:00,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:01,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:01,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-10-02 11:56:01,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-02 11:56:01,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-02 11:56:01,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-02 11:56:01,166 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-10-02 11:56:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:01,562 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-02 11:56:01,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-02 11:56:01,563 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-10-02 11:56:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:01,564 INFO L225 Difference]: With dead ends: 175 [2018-10-02 11:56:01,564 INFO L226 Difference]: Without dead ends: 174 [2018-10-02 11:56:01,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-02 11:56:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-02 11:56:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-10-02 11:56:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-02 11:56:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-02 11:56:01,570 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-10-02 11:56:01,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:01,571 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-02 11:56:01,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-02 11:56:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-02 11:56:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-02 11:56:01,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:01,572 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-10-02 11:56:01,572 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:01,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:01,573 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-10-02 11:56:01,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:01,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:01,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:01,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:01,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:02,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:02,698 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:02,716 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:56:02,915 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-02 11:56:02,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:02,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:02,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:02,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:02,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:02,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:04,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:04,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-10-02 11:56:04,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-02 11:56:04,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-02 11:56:04,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-02 11:56:04,181 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-10-02 11:56:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:04,803 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-02 11:56:04,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-02 11:56:04,804 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-10-02 11:56:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:04,805 INFO L225 Difference]: With dead ends: 179 [2018-10-02 11:56:04,805 INFO L226 Difference]: Without dead ends: 178 [2018-10-02 11:56:04,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-02 11:56:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-02 11:56:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-10-02 11:56:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-02 11:56:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-02 11:56:04,813 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-10-02 11:56:04,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:04,813 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-02 11:56:04,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-02 11:56:04,813 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-02 11:56:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-02 11:56:04,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:04,814 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-10-02 11:56:04,814 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:04,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:04,815 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-10-02 11:56:04,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:04,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:04,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:04,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:04,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:05,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:05,911 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-10-02 11:56:05,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:56:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:05,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:05,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:05,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:05,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:05,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:07,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:07,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-10-02 11:56:07,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-02 11:56:07,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-02 11:56:07,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-02 11:56:07,447 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-10-02 11:56:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:07,740 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-10-02 11:56:07,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-02 11:56:07,741 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-10-02 11:56:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:07,742 INFO L225 Difference]: With dead ends: 183 [2018-10-02 11:56:07,742 INFO L226 Difference]: Without dead ends: 182 [2018-10-02 11:56:07,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-02 11:56:07,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-02 11:56:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-10-02 11:56:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-02 11:56:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-02 11:56:07,747 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-10-02 11:56:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:07,747 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-02 11:56:07,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-02 11:56:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-02 11:56:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-02 11:56:07,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:07,748 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-10-02 11:56:07,749 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:07,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:07,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-10-02 11:56:07,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:07,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:07,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:07,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:56:07,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:08,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:08,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:08,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:56:08,886 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:56:08,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:08,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:08,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:08,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:08,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:08,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:10,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:10,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-10-02 11:56:10,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-02 11:56:10,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-02 11:56:10,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-02 11:56:10,367 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-10-02 11:56:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:10,665 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-02 11:56:10,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-02 11:56:10,665 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-10-02 11:56:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:10,667 INFO L225 Difference]: With dead ends: 187 [2018-10-02 11:56:10,667 INFO L226 Difference]: Without dead ends: 186 [2018-10-02 11:56:10,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-02 11:56:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-02 11:56:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-02 11:56:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-02 11:56:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-02 11:56:10,673 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-10-02 11:56:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:10,673 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-02 11:56:10,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-02 11:56:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-02 11:56:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-02 11:56:10,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:10,675 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-10-02 11:56:10,675 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:10,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:10,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-10-02 11:56:10,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:10,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:10,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:10,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:10,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:12,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:12,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:12,262 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:12,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:56:12,439 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-02 11:56:12,439 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:12,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:12,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:12,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:12,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:12,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:13,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:13,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-10-02 11:56:13,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-02 11:56:13,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-02 11:56:13,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-02 11:56:13,901 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-10-02 11:56:14,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:14,215 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-02 11:56:14,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-02 11:56:14,215 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-10-02 11:56:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:14,217 INFO L225 Difference]: With dead ends: 191 [2018-10-02 11:56:14,217 INFO L226 Difference]: Without dead ends: 190 [2018-10-02 11:56:14,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-02 11:56:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-02 11:56:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-10-02 11:56:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-02 11:56:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-02 11:56:14,222 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-10-02 11:56:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:14,223 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-02 11:56:14,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-02 11:56:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-02 11:56:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-02 11:56:14,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:14,224 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-10-02 11:56:14,224 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:14,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:14,224 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-10-02 11:56:14,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:14,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:14,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:14,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:14,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:15,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:15,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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:15,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:56:15,741 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:56:15,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:15,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:15,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:15,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:15,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:15,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:18,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:18,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-10-02 11:56:18,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-02 11:56:18,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-02 11:56:18,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-02 11:56:18,376 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-10-02 11:56:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:18,859 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-02 11:56:18,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-02 11:56:18,860 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-10-02 11:56:18,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:18,861 INFO L225 Difference]: With dead ends: 195 [2018-10-02 11:56:18,862 INFO L226 Difference]: Without dead ends: 194 [2018-10-02 11:56:18,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-02 11:56:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-02 11:56:18,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-10-02 11:56:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-02 11:56:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-02 11:56:18,867 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-10-02 11:56:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:18,868 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-02 11:56:18,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-02 11:56:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-02 11:56:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-02 11:56:18,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:18,869 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-10-02 11:56:18,869 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:18,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:18,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-10-02 11:56:18,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:18,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:18,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:18,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:18,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:20,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:20,713 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:20,722 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:56:20,859 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-02 11:56:20,859 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:20,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:20,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:20,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:20,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:20,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:22,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:22,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-10-02 11:56:22,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-02 11:56:22,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-02 11:56:22,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-02 11:56:22,714 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-10-02 11:56:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:23,132 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-02 11:56:23,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-02 11:56:23,133 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-10-02 11:56:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:23,134 INFO L225 Difference]: With dead ends: 199 [2018-10-02 11:56:23,135 INFO L226 Difference]: Without dead ends: 198 [2018-10-02 11:56:23,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-02 11:56:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-02 11:56:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-10-02 11:56:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-02 11:56:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-02 11:56:23,141 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-10-02 11:56:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:23,141 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-02 11:56:23,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-02 11:56:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-02 11:56:23,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-02 11:56:23,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:23,142 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-10-02 11:56:23,142 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:23,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:23,143 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-10-02 11:56:23,143 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:23,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:23,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:23,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:23,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:24,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:24,496 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:24,504 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:56:24,678 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-02 11:56:24,679 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:24,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:24,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:24,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:24,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:24,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:26,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:26,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-10-02 11:56:26,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-02 11:56:26,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-02 11:56:26,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-02 11:56:26,203 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-10-02 11:56:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:26,577 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-02 11:56:26,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-02 11:56:26,578 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-10-02 11:56:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:26,579 INFO L225 Difference]: With dead ends: 203 [2018-10-02 11:56:26,580 INFO L226 Difference]: Without dead ends: 202 [2018-10-02 11:56:26,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-02 11:56:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-02 11:56:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-10-02 11:56:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-02 11:56:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-02 11:56:26,585 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-10-02 11:56:26,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:26,585 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-02 11:56:26,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-02 11:56:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-02 11:56:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-02 11:56:26,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:26,586 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-10-02 11:56:26,586 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:26,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:26,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-10-02 11:56:26,587 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:26,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:26,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:26,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:26,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:28,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:28,239 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:28,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:56:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:28,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:28,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:28,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:28,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:28,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:29,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:29,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-10-02 11:56:29,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-02 11:56:29,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-02 11:56:29,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-02 11:56:29,885 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-10-02 11:56:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:30,222 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-02 11:56:30,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-02 11:56:30,223 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-10-02 11:56:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:30,224 INFO L225 Difference]: With dead ends: 207 [2018-10-02 11:56:30,224 INFO L226 Difference]: Without dead ends: 206 [2018-10-02 11:56:30,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-02 11:56:30,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-02 11:56:30,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-10-02 11:56:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-02 11:56:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-02 11:56:30,230 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-10-02 11:56:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:30,230 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-02 11:56:30,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-02 11:56:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-02 11:56:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-02 11:56:30,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:30,232 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-10-02 11:56:30,232 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:30,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:30,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-10-02 11:56:30,233 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:30,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:30,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:30,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:56:30,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:31,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:31,630 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:31,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:56:31,698 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:56:31,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:31,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:31,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:31,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:31,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:31,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:33,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:33,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-10-02 11:56:33,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-02 11:56:33,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-02 11:56:33,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-02 11:56:33,788 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-10-02 11:56:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:34,117 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-02 11:56:34,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-02 11:56:34,118 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-10-02 11:56:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:34,120 INFO L225 Difference]: With dead ends: 211 [2018-10-02 11:56:34,120 INFO L226 Difference]: Without dead ends: 210 [2018-10-02 11:56:34,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-02 11:56:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-02 11:56:34,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-10-02 11:56:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-02 11:56:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-02 11:56:34,125 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-10-02 11:56:34,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:34,126 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-02 11:56:34,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-02 11:56:34,126 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-02 11:56:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-02 11:56:34,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:34,127 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-10-02 11:56:34,127 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:34,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:34,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-10-02 11:56:34,128 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:34,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:34,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:34,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:35,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:35,590 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:35,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:56:35,820 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-02 11:56:35,820 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:35,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:35,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:35,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:35,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:35,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:37,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:37,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-10-02 11:56:37,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-02 11:56:37,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-02 11:56:37,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-02 11:56:37,713 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-10-02 11:56:38,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:38,070 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-02 11:56:38,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-02 11:56:38,071 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-10-02 11:56:38,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:38,073 INFO L225 Difference]: With dead ends: 215 [2018-10-02 11:56:38,073 INFO L226 Difference]: Without dead ends: 214 [2018-10-02 11:56:38,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-02 11:56:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-02 11:56:38,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-10-02 11:56:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-02 11:56:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-02 11:56:38,078 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-10-02 11:56:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:38,079 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-02 11:56:38,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-02 11:56:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-02 11:56:38,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-02 11:56:38,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:38,080 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-10-02 11:56:38,080 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:38,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-10-02 11:56:38,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:38,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:38,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:38,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:39,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:39,535 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:39,543 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:56:39,607 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:56:39,608 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:39,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:39,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:39,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:39,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:39,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:41,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:41,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-10-02 11:56:41,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-02 11:56:41,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-02 11:56:41,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-02 11:56:41,428 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-10-02 11:56:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:41,792 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-02 11:56:41,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-02 11:56:41,792 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-10-02 11:56:41,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:41,794 INFO L225 Difference]: With dead ends: 219 [2018-10-02 11:56:41,794 INFO L226 Difference]: Without dead ends: 218 [2018-10-02 11:56:41,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-02 11:56:41,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-02 11:56:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-10-02 11:56:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-02 11:56:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-02 11:56:41,799 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-10-02 11:56:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:41,799 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-02 11:56:41,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-02 11:56:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-02 11:56:41,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-02 11:56:41,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:41,801 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-10-02 11:56:41,801 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:41,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:41,801 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-10-02 11:56:41,801 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:41,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:41,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:41,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:41,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:43,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:43,550 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:43,559 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:56:43,707 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-02 11:56:43,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:43,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:43,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:43,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:43,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:43,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:45,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:45,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-10-02 11:56:45,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-02 11:56:45,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-02 11:56:45,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-02 11:56:45,493 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-10-02 11:56:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:45,871 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-02 11:56:45,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 11:56:45,871 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-10-02 11:56:45,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:45,873 INFO L225 Difference]: With dead ends: 223 [2018-10-02 11:56:45,873 INFO L226 Difference]: Without dead ends: 222 [2018-10-02 11:56:45,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-02 11:56:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-02 11:56:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-10-02 11:56:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-02 11:56:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-02 11:56:45,878 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-10-02 11:56:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:45,878 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-02 11:56:45,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-02 11:56:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-02 11:56:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-02 11:56:45,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:45,879 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-10-02 11:56:45,879 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:45,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:45,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-10-02 11:56:45,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:45,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:45,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:45,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:45,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:47,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:47,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:47,748 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:47,756 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:56:47,974 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-02 11:56:47,975 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:47,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:47,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:47,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:47,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:47,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:49,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:49,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-10-02 11:56:49,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-02 11:56:49,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-02 11:56:49,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-02 11:56:49,922 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-10-02 11:56:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:50,252 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-02 11:56:50,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-02 11:56:50,252 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-10-02 11:56:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:50,254 INFO L225 Difference]: With dead ends: 227 [2018-10-02 11:56:50,254 INFO L226 Difference]: Without dead ends: 226 [2018-10-02 11:56:50,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-02 11:56:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-02 11:56:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-10-02 11:56:50,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-02 11:56:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-02 11:56:50,260 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-10-02 11:56:50,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:50,260 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-02 11:56:50,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-02 11:56:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-02 11:56:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-02 11:56:50,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:50,262 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-10-02 11:56:50,262 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:50,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:50,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-10-02 11:56:50,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:50,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:50,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:50,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:50,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:51,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:51,929 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:51,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:56:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:52,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:52,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:52,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:52,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:52,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:54,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:54,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-10-02 11:56:54,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-02 11:56:54,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-02 11:56:54,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-02 11:56:54,303 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-10-02 11:56:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:54,711 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-02 11:56:54,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-02 11:56:54,712 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-10-02 11:56:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:54,713 INFO L225 Difference]: With dead ends: 231 [2018-10-02 11:56:54,713 INFO L226 Difference]: Without dead ends: 230 [2018-10-02 11:56:54,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-02 11:56:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-02 11:56:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-10-02 11:56:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-02 11:56:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-10-02 11:56:54,720 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-10-02 11:56:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:54,721 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-10-02 11:56:54,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-02 11:56:54,721 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-10-02 11:56:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-02 11:56:54,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:54,722 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-10-02 11:56:54,722 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:54,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:54,723 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-10-02 11:56:54,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:54,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:54,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:54,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:56:54,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:56,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:56,359 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:56,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:56:56,445 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:56:56,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:56,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:56,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:56:56,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:56,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:56,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:58,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:58,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-10-02 11:56:58,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-02 11:56:58,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-02 11:56:58,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-02 11:56:58,753 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-10-02 11:56:59,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:59,188 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-02 11:56:59,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-02 11:56:59,188 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-10-02 11:56:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:59,190 INFO L225 Difference]: With dead ends: 235 [2018-10-02 11:56:59,190 INFO L226 Difference]: Without dead ends: 234 [2018-10-02 11:56:59,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-02 11:56:59,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-02 11:56:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-10-02 11:56:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-02 11:56:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-02 11:56:59,195 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-10-02 11:56:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:59,195 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-02 11:56:59,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-02 11:56:59,195 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-02 11:56:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-02 11:56:59,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:59,196 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-10-02 11:56:59,197 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:56:59,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:59,197 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-10-02 11:56:59,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:59,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:59,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:59,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:59,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:01,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:01,517 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:01,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:57:01,780 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-02 11:57:01,781 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:01,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:01,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:57:01,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:01,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:01,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:04,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:04,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-10-02 11:57:04,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-02 11:57:04,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-02 11:57:04,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-02 11:57:04,379 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-10-02 11:57:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:04,796 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-02 11:57:04,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-02 11:57:04,796 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-10-02 11:57:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:04,798 INFO L225 Difference]: With dead ends: 239 [2018-10-02 11:57:04,798 INFO L226 Difference]: Without dead ends: 238 [2018-10-02 11:57:04,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-02 11:57:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-02 11:57:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-10-02 11:57:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-02 11:57:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-02 11:57:04,802 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-10-02 11:57:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:04,802 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-02 11:57:04,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-02 11:57:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-02 11:57:04,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-02 11:57:04,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:04,803 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-10-02 11:57:04,804 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:04,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-10-02 11:57:04,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:04,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:04,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:04,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:04,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:06,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:06,542 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:06,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:57:06,627 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:57:06,628 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:06,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:06,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:57:06,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:06,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:06,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:09,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:09,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-10-02 11:57:09,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-02 11:57:09,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-02 11:57:09,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-02 11:57:09,039 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-10-02 11:57:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:09,485 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-10-02 11:57:09,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-02 11:57:09,486 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-10-02 11:57:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:09,488 INFO L225 Difference]: With dead ends: 243 [2018-10-02 11:57:09,488 INFO L226 Difference]: Without dead ends: 242 [2018-10-02 11:57:09,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-02 11:57:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-02 11:57:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-10-02 11:57:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-02 11:57:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-02 11:57:09,493 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-10-02 11:57:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:09,493 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-02 11:57:09,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-02 11:57:09,493 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-02 11:57:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-02 11:57:09,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:09,494 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-10-02 11:57:09,494 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:09,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-10-02 11:57:09,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:09,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:09,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:09,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:09,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:11,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:11,528 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:11,635 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:57:11,816 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-02 11:57:11,816 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:11,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:11,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:57:11,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:11,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:11,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:14,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:14,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-10-02 11:57:14,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-02 11:57:14,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-02 11:57:14,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-02 11:57:14,272 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-10-02 11:57:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:14,661 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-02 11:57:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-02 11:57:14,662 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-10-02 11:57:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:14,663 INFO L225 Difference]: With dead ends: 247 [2018-10-02 11:57:14,664 INFO L226 Difference]: Without dead ends: 246 [2018-10-02 11:57:14,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-02 11:57:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-02 11:57:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-10-02 11:57:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-02 11:57:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-02 11:57:14,670 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-10-02 11:57:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:14,671 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-02 11:57:14,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-02 11:57:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-02 11:57:14,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-02 11:57:14,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:14,672 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-10-02 11:57:14,672 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:14,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:14,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-10-02 11:57:14,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:14,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:14,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:14,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:14,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:16,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:16,556 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:16,564 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:57:16,840 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-02 11:57:16,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:16,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:16,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:57:16,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:16,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:16,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:19,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:19,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-10-02 11:57:19,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-02 11:57:19,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-02 11:57:19,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-02 11:57:19,435 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-10-02 11:57:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:19,967 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-02 11:57:19,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-02 11:57:19,968 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-10-02 11:57:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:19,969 INFO L225 Difference]: With dead ends: 251 [2018-10-02 11:57:19,969 INFO L226 Difference]: Without dead ends: 250 [2018-10-02 11:57:19,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-02 11:57:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-02 11:57:19,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-10-02 11:57:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-02 11:57:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-02 11:57:19,976 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-10-02 11:57:19,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:19,976 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-02 11:57:19,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-02 11:57:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-02 11:57:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-02 11:57:19,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:19,977 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-10-02 11:57:19,978 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:19,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:19,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-10-02 11:57:19,978 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:19,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:19,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:19,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:19,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:21,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:21,867 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:21,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:21,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:21,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:57:21,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:21,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:21,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:24,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:24,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-10-02 11:57:24,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-02 11:57:24,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-02 11:57:24,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-02 11:57:24,570 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-10-02 11:57:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:25,020 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-10-02 11:57:25,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-02 11:57:25,020 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-10-02 11:57:25,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:25,022 INFO L225 Difference]: With dead ends: 255 [2018-10-02 11:57:25,022 INFO L226 Difference]: Without dead ends: 254 [2018-10-02 11:57:25,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-02 11:57:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-02 11:57:25,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-10-02 11:57:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-02 11:57:25,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-02 11:57:25,028 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-10-02 11:57:25,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:25,028 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-02 11:57:25,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-02 11:57:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-02 11:57:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-02 11:57:25,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:25,029 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-10-02 11:57:25,029 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:25,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:25,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-10-02 11:57:25,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:25,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:25,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:25,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:25,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:26,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:26,968 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:26,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:57:27,050 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:57:27,050 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:27,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:27,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:57:27,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:27,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:27,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:29,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:29,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-10-02 11:57:29,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-02 11:57:29,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-02 11:57:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-02 11:57:29,754 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-10-02 11:57:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:30,214 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-02 11:57:30,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-02 11:57:30,215 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-10-02 11:57:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:30,217 INFO L225 Difference]: With dead ends: 259 [2018-10-02 11:57:30,217 INFO L226 Difference]: Without dead ends: 258 [2018-10-02 11:57:30,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-02 11:57:30,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-02 11:57:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-10-02 11:57:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-02 11:57:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-02 11:57:30,222 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-10-02 11:57:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:30,222 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-02 11:57:30,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-02 11:57:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-02 11:57:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-02 11:57:30,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:30,224 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-10-02 11:57:30,224 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:30,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:30,224 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-10-02 11:57:30,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:30,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:30,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:30,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:30,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:32,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:32,237 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:32,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:57:32,559 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-02 11:57:32,559 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:32,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:32,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:57:32,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:32,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:32,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:35,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:35,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-10-02 11:57:35,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-02 11:57:35,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-02 11:57:35,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-02 11:57:35,293 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-10-02 11:57:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:35,770 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-02 11:57:35,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-02 11:57:35,771 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-10-02 11:57:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:35,772 INFO L225 Difference]: With dead ends: 263 [2018-10-02 11:57:35,773 INFO L226 Difference]: Without dead ends: 262 [2018-10-02 11:57:35,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-02 11:57:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-02 11:57:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-10-02 11:57:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-02 11:57:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-02 11:57:35,779 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-10-02 11:57:35,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:35,779 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-02 11:57:35,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-02 11:57:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-02 11:57:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-02 11:57:35,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:35,781 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-10-02 11:57:35,781 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:35,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:35,782 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-10-02 11:57:35,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:35,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:35,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:37,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:37,992 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:38,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:57:38,078 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:57:38,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:38,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:38,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:57:38,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:38,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:38,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:41,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:41,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-10-02 11:57:41,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-02 11:57:41,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-02 11:57:41,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-02 11:57:41,200 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-10-02 11:57:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:41,699 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-10-02 11:57:41,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-02 11:57:41,700 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-10-02 11:57:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:41,701 INFO L225 Difference]: With dead ends: 267 [2018-10-02 11:57:41,701 INFO L226 Difference]: Without dead ends: 266 [2018-10-02 11:57:41,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-02 11:57:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-02 11:57:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-10-02 11:57:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-02 11:57:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-10-02 11:57:41,708 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-10-02 11:57:41,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:41,709 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-10-02 11:57:41,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-02 11:57:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-10-02 11:57:41,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-02 11:57:41,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:41,710 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-10-02 11:57:41,710 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:41,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:41,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-10-02 11:57:41,711 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:41,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:41,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:41,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:41,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:44,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:44,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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:44,186 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:57:44,396 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-02 11:57:44,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:44,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:44,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:57:44,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:44,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:44,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:47,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:47,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-10-02 11:57:47,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-02 11:57:47,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-02 11:57:47,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-02 11:57:47,017 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-10-02 11:57:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:47,546 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-02 11:57:47,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-02 11:57:47,546 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-10-02 11:57:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:47,548 INFO L225 Difference]: With dead ends: 271 [2018-10-02 11:57:47,548 INFO L226 Difference]: Without dead ends: 270 [2018-10-02 11:57:47,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-02 11:57:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-02 11:57:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-10-02 11:57:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-02 11:57:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-10-02 11:57:47,554 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-10-02 11:57:47,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:47,554 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-10-02 11:57:47,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-02 11:57:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-10-02 11:57:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-02 11:57:47,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:47,556 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-10-02 11:57:47,556 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:47,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:47,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-10-02 11:57:47,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:47,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:47,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:50,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:50,173 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:50,181 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:57:50,488 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-02 11:57:50,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:50,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:50,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:57:50,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:50,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:50,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:53,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:53,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-10-02 11:57:53,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-02 11:57:53,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-02 11:57:53,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-02 11:57:53,254 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-10-02 11:57:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:53,830 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-02 11:57:53,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-02 11:57:53,830 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-10-02 11:57:53,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:53,831 INFO L225 Difference]: With dead ends: 275 [2018-10-02 11:57:53,831 INFO L226 Difference]: Without dead ends: 274 [2018-10-02 11:57:53,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-02 11:57:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-02 11:57:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-10-02 11:57:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-02 11:57:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-02 11:57:53,837 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-10-02 11:57:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:53,837 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-02 11:57:53,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-02 11:57:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-02 11:57:53,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-02 11:57:53,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:53,838 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-10-02 11:57:53,839 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:53,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:53,839 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-10-02 11:57:53,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:53,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:53,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:53,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:53,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:56,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:56,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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:56,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:56,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:56,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:57:56,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:56,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:56,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:59,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:59,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-10-02 11:57:59,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-02 11:57:59,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-02 11:57:59,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-02 11:57:59,251 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-10-02 11:57:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:59,702 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-02 11:57:59,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-02 11:57:59,702 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-10-02 11:57:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:59,704 INFO L225 Difference]: With dead ends: 279 [2018-10-02 11:57:59,704 INFO L226 Difference]: Without dead ends: 278 [2018-10-02 11:57:59,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-02 11:57:59,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-02 11:57:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-10-02 11:57:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-02 11:57:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-02 11:57:59,711 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-10-02 11:57:59,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:59,711 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-02 11:57:59,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-02 11:57:59,711 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-02 11:57:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-02 11:57:59,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:59,713 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-10-02 11:57:59,713 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:57:59,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-10-02 11:57:59,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:59,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:59,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:59,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:59,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:02,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:02,070 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:02,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:58:02,156 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:58:02,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:02,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:02,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:58:02,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:02,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:02,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:05,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:05,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-10-02 11:58:05,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-02 11:58:05,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-02 11:58:05,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-02 11:58:05,305 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-10-02 11:58:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:05,832 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-02 11:58:05,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-02 11:58:05,832 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-10-02 11:58:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:05,834 INFO L225 Difference]: With dead ends: 283 [2018-10-02 11:58:05,834 INFO L226 Difference]: Without dead ends: 282 [2018-10-02 11:58:05,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-02 11:58:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-02 11:58:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-10-02 11:58:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-02 11:58:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-02 11:58:05,840 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-10-02 11:58:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:05,841 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-02 11:58:05,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-10-02 11:58:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-02 11:58:05,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-02 11:58:05,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:05,842 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-10-02 11:58:05,842 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:05,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:05,843 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-10-02 11:58:05,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:05,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:05,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:05,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:05,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:08,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:08,339 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:08,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:58:08,726 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-02 11:58:08,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:08,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:08,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:58:08,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:08,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:08,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:11,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:11,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-10-02 11:58:11,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-10-02 11:58:11,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-10-02 11:58:11,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-02 11:58:11,920 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-10-02 11:58:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:12,412 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-02 11:58:12,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-02 11:58:12,412 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-10-02 11:58:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:12,414 INFO L225 Difference]: With dead ends: 287 [2018-10-02 11:58:12,414 INFO L226 Difference]: Without dead ends: 286 [2018-10-02 11:58:12,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-02 11:58:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-02 11:58:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-10-02 11:58:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-02 11:58:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-10-02 11:58:12,419 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-10-02 11:58:12,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:12,419 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-10-02 11:58:12,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-10-02 11:58:12,419 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-10-02 11:58:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-02 11:58:12,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:12,420 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-10-02 11:58:12,420 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:12,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:12,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-10-02 11:58:12,421 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:12,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:12,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:12,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:12,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:15,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:15,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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:15,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:58:15,340 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:58:15,341 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:15,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:15,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:58:15,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:15,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:15,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:18,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:18,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-10-02 11:58:18,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-10-02 11:58:18,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-10-02 11:58:18,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-02 11:58:18,340 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-10-02 11:58:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:18,966 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-02 11:58:18,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-02 11:58:18,967 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-10-02 11:58:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:18,969 INFO L225 Difference]: With dead ends: 291 [2018-10-02 11:58:18,969 INFO L226 Difference]: Without dead ends: 290 [2018-10-02 11:58:18,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-02 11:58:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-02 11:58:18,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-10-02 11:58:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-02 11:58:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-10-02 11:58:18,975 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-10-02 11:58:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:18,975 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-10-02 11:58:18,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-10-02 11:58:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-10-02 11:58:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-02 11:58:18,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:18,977 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-10-02 11:58:18,977 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:18,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-10-02 11:58:18,977 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:18,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:18,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:21,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:21,863 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:21,871 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:58:22,112 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-02 11:58:22,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:22,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:22,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:58:22,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:22,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:22,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:25,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:25,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-10-02 11:58:25,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-10-02 11:58:25,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-10-02 11:58:25,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-02 11:58:25,473 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-10-02 11:58:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:26,007 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-02 11:58:26,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-02 11:58:26,008 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-10-02 11:58:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:26,010 INFO L225 Difference]: With dead ends: 295 [2018-10-02 11:58:26,010 INFO L226 Difference]: Without dead ends: 294 [2018-10-02 11:58:26,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-02 11:58:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-02 11:58:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-10-02 11:58:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-02 11:58:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-02 11:58:26,015 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-10-02 11:58:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:26,016 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-02 11:58:26,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-10-02 11:58:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-02 11:58:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-02 11:58:26,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:26,018 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-10-02 11:58:26,018 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:26,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:26,018 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-10-02 11:58:26,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:26,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:26,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:26,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:26,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:28,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:28,836 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:28,843 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:58:29,220 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-02 11:58:29,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:29,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:29,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:58:29,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:29,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:29,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:32,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:32,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-10-02 11:58:32,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-10-02 11:58:32,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-10-02 11:58:32,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-02 11:58:32,676 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-10-02 11:58:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:33,171 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-02 11:58:33,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-02 11:58:33,172 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-10-02 11:58:33,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:33,173 INFO L225 Difference]: With dead ends: 299 [2018-10-02 11:58:33,174 INFO L226 Difference]: Without dead ends: 298 [2018-10-02 11:58:33,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-02 11:58:33,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-02 11:58:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-10-02 11:58:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-02 11:58:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-02 11:58:33,179 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-10-02 11:58:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:33,179 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-02 11:58:33,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-10-02 11:58:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-02 11:58:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-02 11:58:33,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:33,180 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-10-02 11:58:33,181 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:33,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:33,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-10-02 11:58:33,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:33,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:33,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:33,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:33,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:36,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:36,147 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:36,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:58:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:36,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:36,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:58:36,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:36,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:36,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:39,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:39,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-10-02 11:58:39,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-10-02 11:58:39,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-10-02 11:58:39,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-02 11:58:39,518 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-10-02 11:58:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:40,050 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-10-02 11:58:40,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-02 11:58:40,051 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-10-02 11:58:40,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:40,052 INFO L225 Difference]: With dead ends: 303 [2018-10-02 11:58:40,052 INFO L226 Difference]: Without dead ends: 302 [2018-10-02 11:58:40,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-02 11:58:40,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-02 11:58:40,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-10-02 11:58:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-02 11:58:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-02 11:58:40,058 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-10-02 11:58:40,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:40,058 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-02 11:58:40,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-10-02 11:58:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-02 11:58:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-02 11:58:40,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:40,059 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-10-02 11:58:40,059 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:40,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:40,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-10-02 11:58:40,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:40,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:40,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:40,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:58:40,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:42,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:42,753 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:42,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:58:42,845 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:58:42,845 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:42,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:42,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:58:42,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:42,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:42,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:46,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:46,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-10-02 11:58:46,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-10-02 11:58:46,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-10-02 11:58:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-02 11:58:46,241 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-10-02 11:58:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:46,767 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-02 11:58:46,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-02 11:58:46,767 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-10-02 11:58:46,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:46,769 INFO L225 Difference]: With dead ends: 307 [2018-10-02 11:58:46,769 INFO L226 Difference]: Without dead ends: 306 [2018-10-02 11:58:46,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-02 11:58:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-02 11:58:46,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-10-02 11:58:46,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-02 11:58:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-02 11:58:46,775 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-10-02 11:58:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:46,775 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-02 11:58:46,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-10-02 11:58:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-02 11:58:46,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-02 11:58:46,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:46,777 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-10-02 11:58:46,777 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:58:46,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:46,777 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-10-02 11:58:46,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:46,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:46,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:46,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:46,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:49,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:49,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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:49,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:58:50,014 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-02 11:58:50,014 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:50,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:50,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:58:50,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:50,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:50,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:53,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:53,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2018-10-02 11:58:53,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-10-02 11:58:53,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-10-02 11:58:53,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-02 11:58:53,409 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. Received shutdown request... [2018-10-02 11:58:53,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-02 11:58:53,880 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 11:58:53,887 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 11:58:53,887 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:58:53 BoogieIcfgContainer [2018-10-02 11:58:53,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:58:53,888 INFO L168 Benchmark]: Toolchain (without parser) took 238967.69 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -501.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-02 11:58:53,890 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:58:53,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:58:53,890 INFO L168 Benchmark]: Boogie Preprocessor took 25.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:58:53,891 INFO L168 Benchmark]: RCFGBuilder took 373.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 11:58:53,891 INFO L168 Benchmark]: TraceAbstraction took 238507.20 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -522.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-02 11:58:53,893 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.19 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 55.23 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 25.50 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 373.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238507.20 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -522.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and FLOYD_HOARE automaton (currently 72 states, 154 states before enhancement), while ReachableStatesComputation was computing reachable states (280 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 238.3s OverallTime, 76 OverallIterations, 76 TraceHistogramMax, 24.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 4227 SDslu, 4289 SDs, 0 SdLazy, 15924 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14551 GetRequests, 8700 SyntacticMatches, 0 SemanticMatches, 5851 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292600 ImplicationChecksByTransitivity, 185.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 75 MinimizatonAttempts, 75 StatesRemovedByMinimization, 75 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 8.4s SatisfiabilityAnalysisTime, 198.2s InterpolantComputationTime, 23404 NumberOfCodeBlocks, 23404 NumberOfCodeBlocksAsserted, 1607 NumberOfCheckSat, 23253 ConstructedInterpolants, 0 QuantifiedInterpolants, 37828463 SizeOfPredicates, 450 NumberOfNonLiveVariables, 21675 ConjunctsInSsa, 9300 ConjunctsInUnsatCore, 151 InterpolantComputations, 1 PerfectInterpolantSequences, 0/579500 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/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-58-53-901.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-58-53-901.csv Completed graceful shutdown