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-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:33:48,640 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:33:48,642 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:33:48,660 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:33:48,661 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:33:48,663 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:33:48,665 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:33:48,667 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:33:48,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:33:48,669 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:33:48,673 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:33:48,673 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:33:48,674 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:33:48,676 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:33:48,677 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:33:48,680 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:33:48,681 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:33:48,683 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:33:48,693 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:33:48,696 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:33:48,697 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:33:48,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:33:48,704 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:33:48,705 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:33:48,705 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:33:48,706 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:33:48,708 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:33:48,708 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:33:48,711 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:33:48,712 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:33:48,712 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:33:48,714 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:33:48,714 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:33:48,715 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:33:48,716 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:33:48,716 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:33:48,717 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-04 12:33:48,744 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:33:48,745 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:33:48,745 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:33:48,748 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:33:48,749 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:33:48,749 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:33:48,749 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:33:48,749 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:33:48,750 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:33:48,750 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:33:48,750 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:33:48,750 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:33:48,750 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:33:48,751 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:33:48,752 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:33:48,752 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:33:48,752 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:33:48,753 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:33:48,754 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:33:48,754 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:33:48,754 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:33:48,754 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:33:48,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:33:48,755 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:33:48,755 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:33:48,755 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:33:48,755 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:33:48,756 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:33:48,756 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:33:48,756 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:33:48,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:33:48,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:33:48,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:33:48,840 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:33:48,841 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:33:48,842 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2018-10-04 12:33:48,842 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2018-10-04 12:33:48,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:33:48,902 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:33:48,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:33:48,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:33:48,903 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:33:48,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:48" (1/1) ... [2018-10-04 12:33:48,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:48" (1/1) ... [2018-10-04 12:33:48,947 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:33:48,947 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:33:48,948 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:33:48,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:33:48,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:33:48,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:33:48,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:33:48,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:48" (1/1) ... [2018-10-04 12:33:48,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:48" (1/1) ... [2018-10-04 12:33:48,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:48" (1/1) ... [2018-10-04 12:33:48,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:48" (1/1) ... [2018-10-04 12:33:48,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:48" (1/1) ... [2018-10-04 12:33:48,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:48" (1/1) ... [2018-10-04 12:33:48,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:48" (1/1) ... [2018-10-04 12:33:48,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:33:48,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:33:48,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:33:48,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:33:48,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:33:49,073 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 12:33:49,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 12:33:49,074 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-10-04 12:33:49,331 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:33:49,331 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:33:49 BoogieIcfgContainer [2018-10-04 12:33:49,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:33:49,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:33:49,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:33:49,336 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:33:49,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:48" (1/2) ... [2018-10-04 12:33:49,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba35110 and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:33:49, skipping insertion in model container [2018-10-04 12:33:49,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:33:49" (2/2) ... [2018-10-04 12:33:49,340 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2018-10-04 12:33:49,351 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:33:49,359 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:33:49,464 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:33:49,465 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:33:49,465 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:33:49,466 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:33:49,466 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:33:49,466 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:33:49,466 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:33:49,466 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:33:49,467 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:33:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-10-04 12:33:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:33:49,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:49,490 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:33:49,491 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:49,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:49,498 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-10-04 12:33:49,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:49,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:49,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:49,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:49,726 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-04 12:33:49,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:33:49,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 12:33:49,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:33:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:33:49,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:33:49,747 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-10-04 12:33:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:49,822 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-10-04 12:33:49,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:33:49,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-04 12:33:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:49,837 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:33:49,837 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 12:33:49,841 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-04 12:33:49,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 12:33:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-10-04 12:33:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:33:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:33:49,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-10-04 12:33:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:49,878 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:33:49,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:33:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:33:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:33:49,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:49,879 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-04 12:33:49,880 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:49,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:49,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-10-04 12:33:49,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:49,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:49,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:49,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:49,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:49,974 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-04 12:33:49,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:49,975 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:49,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:50,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:50,076 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-04 12:33:50,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:50,110 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-04 12:33:50,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:50,166 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-04 12:33:50,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:50,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-10-04 12:33:50,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:33:50,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:33:50,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:33:50,200 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-10-04 12:33:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:50,286 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 12:33:50,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:33:50,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-10-04 12:33:50,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:50,288 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:33:50,288 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 12:33:50,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:33:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 12:33:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-10-04 12:33:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 12:33:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 12:33:50,293 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-10-04 12:33:50,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:50,294 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 12:33:50,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:33:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 12:33:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:33:50,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:50,295 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-10-04 12:33:50,296 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:50,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:50,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-10-04 12:33:50,296 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:50,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:50,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:50,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:50,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:50,472 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-04 12:33:50,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:50,472 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-04 12:33:50,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:50,537 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:50,537 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:50,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:50,567 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-04 12:33:50,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:50,660 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-04 12:33:50,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:50,767 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-04 12:33:50,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:50,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-10-04 12:33:50,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:33:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:33:50,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:33:50,789 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-10-04 12:33:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:50,865 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 12:33:50,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:33:50,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:33:50,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:50,867 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:33:50,867 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 12:33:50,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:33:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 12:33:50,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-10-04 12:33:50,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:33:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 12:33:50,873 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-10-04 12:33:50,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:50,874 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 12:33:50,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:33:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 12:33:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:33:50,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:50,875 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-10-04 12:33:50,876 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:50,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:50,876 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-10-04 12:33:50,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:50,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:50,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:50,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:51,005 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-04 12:33:51,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:51,005 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-04 12:33:51,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:51,053 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:33:51,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:51,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:51,077 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-04 12:33:51,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:51,140 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-04 12:33:51,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:51,308 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-04 12:33:51,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:51,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-04 12:33:51,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:51,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:51,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:51,336 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-10-04 12:33:51,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:51,390 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 12:33:51,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:33:51,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-10-04 12:33:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:51,391 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:33:51,392 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 12:33:51,392 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-04 12:33:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 12:33:51,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-10-04 12:33:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:33:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 12:33:51,398 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-10-04 12:33:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:51,398 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 12:33:51,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 12:33:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:33:51,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:51,399 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-10-04 12:33:51,400 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:51,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:51,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-10-04 12:33:51,400 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:51,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:51,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:51,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:51,519 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-04 12:33:51,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:51,519 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-04 12:33:51,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:51,540 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:51,541 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:51,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:51,557 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-04 12:33:51,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:51,569 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-04 12:33:51,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:51,991 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-04 12:33:52,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:52,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-10-04 12:33:52,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:33:52,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:33:52,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:33:52,017 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-10-04 12:33:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:52,074 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 12:33:52,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:33:52,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-10-04 12:33:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:52,076 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:33:52,076 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 12:33:52,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:33:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 12:33:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-04 12:33:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:33:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 12:33:52,082 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-10-04 12:33:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:52,083 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 12:33:52,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:33:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 12:33:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:33:52,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:52,084 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-10-04 12:33:52,084 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:52,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:52,085 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-10-04 12:33:52,085 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:52,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:52,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:52,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:52,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:52,303 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-04 12:33:52,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:52,304 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-04 12:33:52,313 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:52,328 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:33:52,329 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:52,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:52,338 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-04 12:33:52,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:52,349 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-04 12:33:52,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:52,466 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-04 12:33:52,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:52,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 12:33:52,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:33:52,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:33:52,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:33:52,488 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-10-04 12:33:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:52,537 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 12:33:52,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:33:52,538 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-10-04 12:33:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:52,540 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:33:52,540 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:33:52,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:33:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:33:52,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-04 12:33:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:33:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 12:33:52,546 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-10-04 12:33:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:52,546 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 12:33:52,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:33:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 12:33:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:33:52,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:52,548 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-10-04 12:33:52,548 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:52,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:52,548 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-10-04 12:33:52,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:52,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:52,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:52,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:52,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:52,833 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-04 12:33:52,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:52,834 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-04 12:33:52,842 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:52,868 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:33:52,868 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:52,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:52,876 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-04 12:33:52,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:52,886 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-04 12:33:52,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:53,063 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-04 12:33:53,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:53,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-04 12:33:53,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:33:53,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:33:53,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:33:53,085 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-10-04 12:33:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:53,177 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 12:33:53,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:53,178 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-10-04 12:33:53,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:53,179 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:33:53,180 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 12:33:53,180 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-04 12:33:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 12:33:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-04 12:33:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:33:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 12:33:53,186 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-10-04 12:33:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:53,186 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 12:33:53,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:33:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 12:33:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:33:53,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:53,187 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-10-04 12:33:53,188 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:53,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:53,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-10-04 12:33:53,188 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:53,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:53,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:53,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:53,332 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-04 12:33:53,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:53,332 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-04 12:33:53,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:53,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:53,371 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-04 12:33:53,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:53,381 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-04 12:33:53,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:53,547 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-04 12:33:53,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:53,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-10-04 12:33:53,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:33:53,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:33:53,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:33:53,577 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-10-04 12:33:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:53,802 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 12:33:53,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:53,803 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-10-04 12:33:53,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:53,804 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:33:53,804 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 12:33:53,805 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-04 12:33:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 12:33:53,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-10-04 12:33:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:33:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 12:33:53,810 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-10-04 12:33:53,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:53,811 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 12:33:53,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:33:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 12:33:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:33:53,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:53,812 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-10-04 12:33:53,813 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:53,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:53,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-10-04 12:33:53,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:53,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:53,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:53,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:53,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:54,018 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-04 12:33:54,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:54,018 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-04 12:33:54,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:54,068 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:54,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:54,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:54,088 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-04 12:33:54,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:54,101 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-04 12:33:54,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:54,347 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-04 12:33:54,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:54,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-10-04 12:33:54,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:33:54,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:33:54,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:33:54,381 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-10-04 12:33:54,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:54,503 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 12:33:54,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:33:54,504 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-10-04 12:33:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:54,505 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:54,505 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 12:33:54,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:33:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 12:33:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-10-04 12:33:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 12:33:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 12:33:54,512 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-10-04 12:33:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:54,512 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 12:33:54,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:33:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 12:33:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 12:33:54,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:54,513 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-10-04 12:33:54,514 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:54,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-10-04 12:33:54,514 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:54,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:54,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:54,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:54,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:54,720 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-04 12:33:54,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:54,720 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-04 12:33:54,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:54,758 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 12:33:54,758 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:54,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:54,769 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-04 12:33:54,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:54,778 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-04 12:33:54,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:55,113 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-04 12:33:55,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:55,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-10-04 12:33:55,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:33:55,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:33:55,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:33:55,136 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-10-04 12:33:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:55,248 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 12:33:55,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:33:55,249 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-10-04 12:33:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:55,250 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:33:55,250 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 12:33:55,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:33:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 12:33:55,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-04 12:33:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 12:33:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 12:33:55,257 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-10-04 12:33:55,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:55,257 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 12:33:55,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:33:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 12:33:55,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:33:55,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:55,259 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-10-04 12:33:55,259 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:55,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:55,259 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-10-04 12:33:55,260 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:55,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:55,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:55,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:55,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:56,007 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-04 12:33:56,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:56,008 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:33:56,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:56,054 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:56,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:56,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:56,077 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-04 12:33:56,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:56,174 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-04 12:33:56,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:56,657 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-04 12:33:56,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:56,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-10-04 12:33:56,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:33:56,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:33:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:33:56,679 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-10-04 12:33:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:56,794 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-04 12:33:56,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:33:56,795 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-10-04 12:33:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:56,796 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:33:56,796 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 12:33:56,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:33:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 12:33:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-04 12:33:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 12:33:56,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-04 12:33:56,802 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-10-04 12:33:56,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:56,802 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-04 12:33:56,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:33:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-04 12:33:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 12:33:56,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:56,804 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-10-04 12:33:56,804 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:56,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:56,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-10-04 12:33:56,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:56,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:56,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:56,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:56,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:57,018 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-04 12:33:57,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:57,018 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-04 12:33:57,032 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:57,152 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 12:33:57,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:57,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:57,164 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-04 12:33:57,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:57,195 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-04 12:33:57,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:57,480 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-04 12:33:57,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:57,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-10-04 12:33:57,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 12:33:57,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 12:33:57,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:33:57,502 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-10-04 12:33:57,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:57,602 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-04 12:33:57,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:33:57,603 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-10-04 12:33:57,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:57,604 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:33:57,604 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 12:33:57,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:33:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 12:33:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-04 12:33:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 12:33:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-04 12:33:57,611 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-10-04 12:33:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:57,611 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-04 12:33:57,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 12:33:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-04 12:33:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 12:33:57,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:57,613 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-10-04 12:33:57,613 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:57,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:57,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-10-04 12:33:57,614 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:57,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:57,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:57,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:57,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:58,075 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-04 12:33:58,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:58,076 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-04 12:33:58,083 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:58,141 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:33:58,141 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:58,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:58,170 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-04 12:33:58,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:58,205 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-04 12:33:58,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:58,443 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-04 12:33:58,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:58,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-10-04 12:33:58,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 12:33:58,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 12:33:58,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-04 12:33:58,466 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-10-04 12:33:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:58,583 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-04 12:33:58,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:33:58,584 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-10-04 12:33:58,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:58,585 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:33:58,585 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 12:33:58,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-04 12:33:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 12:33:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-04 12:33:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 12:33:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-04 12:33:58,593 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-10-04 12:33:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:58,593 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-04 12:33:58,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 12:33:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-04 12:33:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 12:33:58,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:58,594 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-10-04 12:33:58,595 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:58,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:58,595 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-10-04 12:33:58,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:58,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:58,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:58,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:58,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:58,837 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-04 12:33:58,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:58,837 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-04 12:33:58,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:58,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:58,877 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-04 12:33:58,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:58,883 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-04 12:33:58,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:59,169 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-04 12:33:59,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:59,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-10-04 12:33:59,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 12:33:59,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 12:33:59,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-04 12:33:59,200 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-10-04 12:33:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:59,371 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-04 12:33:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:33:59,372 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-10-04 12:33:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:59,372 INFO L225 Difference]: With dead ends: 63 [2018-10-04 12:33:59,373 INFO L226 Difference]: Without dead ends: 62 [2018-10-04 12:33:59,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-04 12:33:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-04 12:33:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-04 12:33:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 12:33:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-04 12:33:59,382 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-10-04 12:33:59,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:59,382 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-04 12:33:59,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 12:33:59,382 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-04 12:33:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 12:33:59,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:59,388 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-10-04 12:33:59,388 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:59,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:59,388 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-10-04 12:33:59,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:59,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:59,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:59,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:59,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:59,659 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-04 12:33:59,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:59,659 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-04 12:33:59,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:59,695 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:59,695 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:59,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:59,722 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-04 12:33:59,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:59,814 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-04 12:33:59,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:00,121 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-04 12:34:00,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:00,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-10-04 12:34:00,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 12:34:00,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 12:34:00,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:34:00,143 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-10-04 12:34:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:00,281 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-04 12:34:00,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:34:00,282 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-10-04 12:34:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:00,283 INFO L225 Difference]: With dead ends: 67 [2018-10-04 12:34:00,283 INFO L226 Difference]: Without dead ends: 66 [2018-10-04 12:34:00,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:34:00,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-04 12:34:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-10-04 12:34:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 12:34:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-04 12:34:00,290 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-10-04 12:34:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:00,290 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-04 12:34:00,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 12:34:00,291 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-04 12:34:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-04 12:34:00,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:00,292 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-10-04 12:34:00,292 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:00,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:00,292 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-10-04 12:34:00,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:00,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:00,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:00,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:00,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:01,205 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-04 12:34:01,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:01,205 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:34:01,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:01,249 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 12:34:01,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:01,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:01,257 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-04 12:34:01,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:01,267 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-04 12:34:01,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:01,544 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-04 12:34:01,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:01,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-10-04 12:34:01,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 12:34:01,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 12:34:01,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:34:01,577 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-10-04 12:34:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:01,703 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-04 12:34:01,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:34:01,704 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-10-04 12:34:01,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:01,705 INFO L225 Difference]: With dead ends: 71 [2018-10-04 12:34:01,705 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 12:34:01,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:34:01,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 12:34:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-04 12:34:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-04 12:34:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-04 12:34:01,712 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-10-04 12:34:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:01,712 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-04 12:34:01,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 12:34:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-04 12:34:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 12:34:01,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:01,714 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-10-04 12:34:01,714 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:01,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-10-04 12:34:01,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:01,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:01,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:02,206 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-04 12:34:02,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:02,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 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-04 12:34:02,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:02,239 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:02,239 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:02,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:02,261 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-04 12:34:02,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:02,279 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-04 12:34:02,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:02,680 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-04 12:34:02,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:02,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-10-04 12:34:02,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 12:34:02,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 12:34:02,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 12:34:02,702 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-10-04 12:34:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:02,820 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-04 12:34:02,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:34:02,820 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-10-04 12:34:02,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:02,821 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:34:02,821 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 12:34:02,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 12:34:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 12:34:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-10-04 12:34:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 12:34:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-04 12:34:02,828 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-10-04 12:34:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:02,828 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-04 12:34:02,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 12:34:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-04 12:34:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-04 12:34:02,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:02,829 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-10-04 12:34:02,830 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:02,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:02,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-10-04 12:34:02,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:02,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:02,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:02,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:02,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:03,412 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-04 12:34:03,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:03,413 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-04 12:34:03,421 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:03,460 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 12:34:03,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:03,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:03,468 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-04 12:34:03,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:03,478 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-04 12:34:03,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:03,792 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-04 12:34:03,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:03,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-10-04 12:34:03,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 12:34:03,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 12:34:03,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 12:34:03,813 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-10-04 12:34:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:03,912 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-04 12:34:03,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:34:03,912 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-10-04 12:34:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:03,913 INFO L225 Difference]: With dead ends: 79 [2018-10-04 12:34:03,914 INFO L226 Difference]: Without dead ends: 78 [2018-10-04 12:34:03,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 12:34:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-04 12:34:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-10-04 12:34:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 12:34:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-04 12:34:03,919 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-10-04 12:34:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:03,919 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-04 12:34:03,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 12:34:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-04 12:34:03,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-04 12:34:03,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:03,920 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-10-04 12:34:03,921 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:03,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:03,921 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-10-04 12:34:03,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:03,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:04,261 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-04 12:34:04,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:04,261 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-04 12:34:04,269 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:04,312 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 12:34:04,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:04,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:04,320 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-04 12:34:04,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:04,331 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-04 12:34:04,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:04,749 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-04 12:34:04,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:04,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-10-04 12:34:04,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 12:34:04,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 12:34:04,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-04 12:34:04,772 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-10-04 12:34:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:04,882 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-04 12:34:04,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:34:04,882 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-10-04 12:34:04,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:04,883 INFO L225 Difference]: With dead ends: 83 [2018-10-04 12:34:04,883 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 12:34:04,884 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-04 12:34:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 12:34:04,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-04 12:34:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-04 12:34:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-04 12:34:04,888 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-10-04 12:34:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:04,888 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-04 12:34:04,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 12:34:04,889 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-04 12:34:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-04 12:34:04,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:04,890 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-10-04 12:34:04,890 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:04,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:04,890 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-10-04 12:34:04,890 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:04,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:04,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:04,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:04,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:05,300 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-04 12:34:05,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:05,300 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-04 12:34:05,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:05,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:05,340 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-04 12:34:05,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:05,351 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-04 12:34:05,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:05,917 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-04 12:34:05,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:05,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-10-04 12:34:05,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 12:34:05,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 12:34:05,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 12:34:05,939 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-10-04 12:34:06,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:06,107 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-04 12:34:06,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:34:06,108 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-10-04 12:34:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:06,109 INFO L225 Difference]: With dead ends: 87 [2018-10-04 12:34:06,109 INFO L226 Difference]: Without dead ends: 86 [2018-10-04 12:34:06,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 12:34:06,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-04 12:34:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-10-04 12:34:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 12:34:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-04 12:34:06,115 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-10-04 12:34:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:06,115 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-04 12:34:06,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 12:34:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-04 12:34:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-04 12:34:06,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:06,117 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-10-04 12:34:06,117 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:06,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:06,117 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-10-04 12:34:06,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:06,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:06,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:06,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:06,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:06,620 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-04 12:34:06,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:06,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 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-04 12:34:06,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:06,650 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:06,650 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:06,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:06,655 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-04 12:34:06,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:06,663 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-04 12:34:06,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:07,005 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-04 12:34:07,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:07,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-10-04 12:34:07,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 12:34:07,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 12:34:07,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 12:34:07,026 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-10-04 12:34:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:07,180 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-04 12:34:07,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:34:07,180 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-10-04 12:34:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:07,181 INFO L225 Difference]: With dead ends: 91 [2018-10-04 12:34:07,182 INFO L226 Difference]: Without dead ends: 90 [2018-10-04 12:34:07,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 12:34:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-04 12:34:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-10-04 12:34:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 12:34:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-04 12:34:07,186 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-10-04 12:34:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:07,186 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-04 12:34:07,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 12:34:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-04 12:34:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-04 12:34:07,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:07,187 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-10-04 12:34:07,187 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:07,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:07,187 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-10-04 12:34:07,188 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:07,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:07,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:07,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:07,638 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-04 12:34:07,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:07,638 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-04 12:34:07,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:07,698 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 12:34:07,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:07,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:07,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-04 12:34:07,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:07,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-04 12:34:07,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:09,415 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-04 12:34:09,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:09,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-10-04 12:34:09,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 12:34:09,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 12:34:09,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 12:34:09,437 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-10-04 12:34:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:09,581 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-04 12:34:09,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:34:09,583 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-10-04 12:34:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:09,585 INFO L225 Difference]: With dead ends: 95 [2018-10-04 12:34:09,585 INFO L226 Difference]: Without dead ends: 94 [2018-10-04 12:34:09,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 12:34:09,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-04 12:34:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-10-04 12:34:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-04 12:34:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-04 12:34:09,588 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-10-04 12:34:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:09,589 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-04 12:34:09,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 12:34:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-04 12:34:09,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-04 12:34:09,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:09,589 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-10-04 12:34:09,590 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:09,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:09,590 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-10-04 12:34:09,590 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:09,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:09,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:09,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:09,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:09,939 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-04 12:34:09,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:09,939 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-04 12:34:09,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:09,984 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:09,984 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:09,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:09,993 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-04 12:34:09,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:10,003 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-04 12:34:10,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:10,412 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-04 12:34:10,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:10,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-10-04 12:34:10,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 12:34:10,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 12:34:10,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 12:34:10,435 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-10-04 12:34:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:10,590 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-04 12:34:10,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:34:10,591 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-10-04 12:34:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:10,592 INFO L225 Difference]: With dead ends: 99 [2018-10-04 12:34:10,592 INFO L226 Difference]: Without dead ends: 98 [2018-10-04 12:34:10,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 12:34:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-04 12:34:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-10-04 12:34:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-04 12:34:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-04 12:34:10,598 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-10-04 12:34:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:10,598 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-04 12:34:10,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 12:34:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-04 12:34:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-04 12:34:10,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:10,599 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-10-04 12:34:10,599 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:10,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:10,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-10-04 12:34:10,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:10,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:10,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:10,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:10,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:11,125 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-04 12:34:11,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:11,126 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-04 12:34:11,134 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:11,186 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 12:34:11,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:11,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:11,206 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-04 12:34:11,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:11,295 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-04 12:34:11,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:11,891 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-04 12:34:11,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:11,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-10-04 12:34:11,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 12:34:11,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 12:34:11,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:34:11,913 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-10-04 12:34:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:12,176 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-04 12:34:12,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:34:12,176 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-10-04 12:34:12,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:12,178 INFO L225 Difference]: With dead ends: 103 [2018-10-04 12:34:12,178 INFO L226 Difference]: Without dead ends: 102 [2018-10-04 12:34:12,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:34:12,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-04 12:34:12,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-10-04 12:34:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-04 12:34:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-04 12:34:12,182 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-10-04 12:34:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:12,183 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-04 12:34:12,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 12:34:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-04 12:34:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-04 12:34:12,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:12,184 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-10-04 12:34:12,184 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:12,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:12,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-10-04 12:34:12,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:12,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:12,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:12,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:12,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:12,752 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-04 12:34:12,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:12,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 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-04 12:34:12,760 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:12,815 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 12:34:12,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:12,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:12,838 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-04 12:34:12,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:12,854 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-04 12:34:12,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:13,499 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-04 12:34:13,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:13,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-10-04 12:34:13,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 12:34:13,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 12:34:13,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 12:34:13,522 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-10-04 12:34:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:13,737 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-04 12:34:13,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:34:13,737 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-10-04 12:34:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:13,738 INFO L225 Difference]: With dead ends: 107 [2018-10-04 12:34:13,738 INFO L226 Difference]: Without dead ends: 106 [2018-10-04 12:34:13,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 12:34:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-04 12:34:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-04 12:34:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-04 12:34:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-04 12:34:13,743 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-10-04 12:34:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:13,744 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-04 12:34:13,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 12:34:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-04 12:34:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-04 12:34:13,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:13,745 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-10-04 12:34:13,745 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:13,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:13,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-10-04 12:34:13,745 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:13,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:13,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:13,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:13,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:14,212 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-04 12:34:14,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:14,212 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-04 12:34:14,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:14,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:14,253 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-04 12:34:14,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:14,263 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-04 12:34:14,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:14,996 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-04 12:34:15,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:15,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-10-04 12:34:15,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 12:34:15,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 12:34:15,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 12:34:15,018 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-10-04 12:34:15,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:15,197 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-04 12:34:15,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:34:15,198 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-10-04 12:34:15,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:15,199 INFO L225 Difference]: With dead ends: 111 [2018-10-04 12:34:15,199 INFO L226 Difference]: Without dead ends: 110 [2018-10-04 12:34:15,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 12:34:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-04 12:34:15,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-10-04 12:34:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 12:34:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-04 12:34:15,205 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-10-04 12:34:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:15,205 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-04 12:34:15,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 12:34:15,205 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-04 12:34:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-04 12:34:15,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:15,206 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-10-04 12:34:15,206 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:15,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:15,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-10-04 12:34:15,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:15,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:15,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:15,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:15,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:15,812 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-04 12:34:15,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:15,812 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-04 12:34:15,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:15,844 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:15,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:15,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:15,853 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-04 12:34:15,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:15,863 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-04 12:34:15,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:16,368 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-04 12:34:16,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:16,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-10-04 12:34:16,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 12:34:16,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 12:34:16,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 12:34:16,391 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-10-04 12:34:16,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:16,601 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-04 12:34:16,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:34:16,602 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-10-04 12:34:16,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:16,603 INFO L225 Difference]: With dead ends: 115 [2018-10-04 12:34:16,603 INFO L226 Difference]: Without dead ends: 114 [2018-10-04 12:34:16,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 12:34:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-04 12:34:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-10-04 12:34:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-04 12:34:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-04 12:34:16,610 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-10-04 12:34:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:16,610 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-04 12:34:16,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 12:34:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-04 12:34:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-04 12:34:16,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:16,611 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-10-04 12:34:16,612 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:16,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:16,612 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-10-04 12:34:16,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:16,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:16,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:17,138 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-04 12:34:17,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:17,138 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-04 12:34:17,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:17,222 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-04 12:34:17,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:17,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:17,264 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-04 12:34:17,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:17,271 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-04 12:34:17,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:17,833 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-04 12:34:17,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:17,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-10-04 12:34:17,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 12:34:17,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 12:34:17,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:34:17,855 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-10-04 12:34:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:18,056 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-04 12:34:18,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:34:18,056 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-10-04 12:34:18,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:18,058 INFO L225 Difference]: With dead ends: 119 [2018-10-04 12:34:18,058 INFO L226 Difference]: Without dead ends: 118 [2018-10-04 12:34:18,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:34:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-04 12:34:18,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-10-04 12:34:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-04 12:34:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-04 12:34:18,063 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-10-04 12:34:18,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:18,063 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-04 12:34:18,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 12:34:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-04 12:34:18,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-04 12:34:18,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:18,064 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-10-04 12:34:18,065 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:18,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:18,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-10-04 12:34:18,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:18,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:18,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:18,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:18,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:18,873 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-04 12:34:18,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:18,873 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-04 12:34:18,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:18,914 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:18,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:18,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:18,921 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-04 12:34:18,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:18,934 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-04 12:34:18,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:19,578 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-04 12:34:19,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:19,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-10-04 12:34:19,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 12:34:19,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 12:34:19,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 12:34:19,600 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-10-04 12:34:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:19,775 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-04 12:34:19,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:34:19,776 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-10-04 12:34:19,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:19,777 INFO L225 Difference]: With dead ends: 123 [2018-10-04 12:34:19,777 INFO L226 Difference]: Without dead ends: 122 [2018-10-04 12:34:19,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 12:34:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-04 12:34:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-10-04 12:34:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-04 12:34:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-04 12:34:19,783 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-10-04 12:34:19,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:19,784 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-04 12:34:19,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 12:34:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-04 12:34:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-04 12:34:19,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:19,785 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-10-04 12:34:19,785 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:19,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:19,785 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-10-04 12:34:19,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:19,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:19,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:19,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:19,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:20,436 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-04 12:34:20,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:20,436 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-04 12:34:20,444 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:20,513 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-04 12:34:20,513 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:20,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:20,536 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-04 12:34:20,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:20,626 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-04 12:34:20,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:21,253 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-04 12:34:21,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:21,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-10-04 12:34:21,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 12:34:21,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 12:34:21,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:34:21,277 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-10-04 12:34:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:21,534 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-04 12:34:21,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:34:21,534 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-10-04 12:34:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:21,536 INFO L225 Difference]: With dead ends: 127 [2018-10-04 12:34:21,536 INFO L226 Difference]: Without dead ends: 126 [2018-10-04 12:34:21,537 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-04 12:34:21,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-04 12:34:21,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-10-04 12:34:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-04 12:34:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-04 12:34:21,542 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-10-04 12:34:21,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:21,542 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-04 12:34:21,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 12:34:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-04 12:34:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-04 12:34:21,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:21,543 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-10-04 12:34:21,543 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:21,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:21,544 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-10-04 12:34:21,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:21,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:21,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:21,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:21,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:22,307 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-04 12:34:22,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:22,308 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-04 12:34:22,317 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:22,392 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 12:34:22,392 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:22,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:22,403 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-04 12:34:22,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:22,412 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-04 12:34:22,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:23,074 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-04 12:34:23,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:23,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-10-04 12:34:23,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 12:34:23,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 12:34:23,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:34:23,096 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-10-04 12:34:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:23,298 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-04 12:34:23,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:34:23,299 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-10-04 12:34:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:23,300 INFO L225 Difference]: With dead ends: 131 [2018-10-04 12:34:23,300 INFO L226 Difference]: Without dead ends: 130 [2018-10-04 12:34:23,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:34:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-04 12:34:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-10-04 12:34:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-04 12:34:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-04 12:34:23,305 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-10-04 12:34:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:23,305 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-04 12:34:23,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 12:34:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-04 12:34:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-04 12:34:23,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:23,306 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-10-04 12:34:23,307 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:23,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:23,307 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-10-04 12:34:23,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:23,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:23,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:23,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:23,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:24,227 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-04 12:34:24,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:24,227 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-04 12:34:24,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:24,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:24,279 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-04 12:34:24,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:24,287 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-04 12:34:24,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:24,994 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-04 12:34:25,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:25,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-10-04 12:34:25,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 12:34:25,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 12:34:25,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-04 12:34:25,015 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-10-04 12:34:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:25,219 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-04 12:34:25,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:34:25,219 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-10-04 12:34:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:25,221 INFO L225 Difference]: With dead ends: 135 [2018-10-04 12:34:25,221 INFO L226 Difference]: Without dead ends: 134 [2018-10-04 12:34:25,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-04 12:34:25,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-04 12:34:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-10-04 12:34:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-04 12:34:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-04 12:34:25,227 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-10-04 12:34:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:25,228 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-04 12:34:25,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 12:34:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-04 12:34:25,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-04 12:34:25,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:25,229 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-10-04 12:34:25,229 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:25,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:25,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-10-04 12:34:25,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:25,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:25,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:25,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:25,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:26,014 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-04 12:34:26,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:26,014 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-04 12:34:26,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:26,067 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:26,067 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:26,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:26,073 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-04 12:34:26,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:26,090 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-04 12:34:26,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:27,127 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-04 12:34:27,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:27,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-10-04 12:34:27,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 12:34:27,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 12:34:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 12:34:27,149 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-10-04 12:34:27,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:27,375 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-04 12:34:27,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:34:27,376 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-10-04 12:34:27,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:27,378 INFO L225 Difference]: With dead ends: 139 [2018-10-04 12:34:27,378 INFO L226 Difference]: Without dead ends: 138 [2018-10-04 12:34:27,379 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-04 12:34:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-04 12:34:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-10-04 12:34:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-04 12:34:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-04 12:34:27,384 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-10-04 12:34:27,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:27,384 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-04 12:34:27,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 12:34:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-04 12:34:27,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-04 12:34:27,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:27,385 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-10-04 12:34:27,385 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:27,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:27,386 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-10-04 12:34:27,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:27,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:27,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:27,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:27,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:28,063 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-04 12:34:28,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:28,063 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-04 12:34:28,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:28,238 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-04 12:34:28,238 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:28,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:28,258 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-04 12:34:28,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:28,348 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-04 12:34:28,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:30,804 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-04 12:34:30,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:30,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-10-04 12:34:30,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 12:34:30,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 12:34:30,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 12:34:30,826 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-10-04 12:34:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:31,127 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-04 12:34:31,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:34:31,128 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-10-04 12:34:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:31,129 INFO L225 Difference]: With dead ends: 143 [2018-10-04 12:34:31,129 INFO L226 Difference]: Without dead ends: 142 [2018-10-04 12:34:31,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 12:34:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-04 12:34:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-10-04 12:34:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-04 12:34:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-04 12:34:31,135 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-10-04 12:34:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:31,136 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-04 12:34:31,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 12:34:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-04 12:34:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-04 12:34:31,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:31,137 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-10-04 12:34:31,137 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:31,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:31,137 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-10-04 12:34:31,138 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:31,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:31,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:31,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:31,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:31,881 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-04 12:34:31,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:31,881 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-04 12:34:31,890 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:31,930 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:31,931 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:31,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:31,937 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-04 12:34:31,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:31,944 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-04 12:34:31,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:32,803 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-04 12:34:32,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:32,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-10-04 12:34:32,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 12:34:32,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 12:34:32,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 12:34:32,826 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-10-04 12:34:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:33,266 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-04 12:34:33,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:34:33,267 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-10-04 12:34:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:33,269 INFO L225 Difference]: With dead ends: 147 [2018-10-04 12:34:33,269 INFO L226 Difference]: Without dead ends: 146 [2018-10-04 12:34:33,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 12:34:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-04 12:34:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-10-04 12:34:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-04 12:34:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-04 12:34:33,275 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-10-04 12:34:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:33,276 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-04 12:34:33,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 12:34:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-04 12:34:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-04 12:34:33,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:33,277 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-10-04 12:34:33,277 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:33,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:33,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-10-04 12:34:33,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:33,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:33,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:33,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:33,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:34,578 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-04 12:34:34,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:34,578 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-04 12:34:34,586 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:34,663 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-04 12:34:34,664 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:34,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:34,671 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-04 12:34:34,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:34,679 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-04 12:34:34,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:35,554 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-04 12:34:35,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:35,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-10-04 12:34:35,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 12:34:35,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 12:34:35,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:34:35,575 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-10-04 12:34:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:35,996 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-04 12:34:35,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 12:34:35,997 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-10-04 12:34:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:35,999 INFO L225 Difference]: With dead ends: 151 [2018-10-04 12:34:35,999 INFO L226 Difference]: Without dead ends: 150 [2018-10-04 12:34:36,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:34:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-04 12:34:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-10-04 12:34:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-04 12:34:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-04 12:34:36,005 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-10-04 12:34:36,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:36,005 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-04 12:34:36,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 12:34:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-04 12:34:36,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-04 12:34:36,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:36,006 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-10-04 12:34:36,006 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:36,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:36,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-10-04 12:34:36,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:36,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:36,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:36,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:36,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:36,822 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-04 12:34:36,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:36,822 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-04 12:34:36,831 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:37,078 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 12:34:37,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:37,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:37,095 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-04 12:34:37,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:37,108 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-04 12:34:37,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:38,059 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-04 12:34:38,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:38,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-10-04 12:34:38,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 12:34:38,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 12:34:38,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 12:34:38,081 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-10-04 12:34:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:38,370 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-04 12:34:38,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:34:38,371 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-10-04 12:34:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:38,372 INFO L225 Difference]: With dead ends: 155 [2018-10-04 12:34:38,373 INFO L226 Difference]: Without dead ends: 154 [2018-10-04 12:34:38,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 12:34:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-04 12:34:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-10-04 12:34:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-04 12:34:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-04 12:34:38,378 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-10-04 12:34:38,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:38,379 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-04 12:34:38,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 12:34:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-04 12:34:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-04 12:34:38,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:38,380 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-10-04 12:34:38,380 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:38,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-10-04 12:34:38,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:38,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:38,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:38,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:38,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:39,456 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-04 12:34:39,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:39,457 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-04 12:34:39,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:39,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:39,524 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-04 12:34:39,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:39,574 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-04 12:34:39,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:40,535 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-04 12:34:40,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:40,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-10-04 12:34:40,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 12:34:40,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 12:34:40,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 12:34:40,558 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-10-04 12:34:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:40,906 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-04 12:34:40,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 12:34:40,906 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-10-04 12:34:40,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:40,907 INFO L225 Difference]: With dead ends: 159 [2018-10-04 12:34:40,907 INFO L226 Difference]: Without dead ends: 158 [2018-10-04 12:34:40,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 12:34:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-04 12:34:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-10-04 12:34:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-04 12:34:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-04 12:34:40,912 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-10-04 12:34:40,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:40,912 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-04 12:34:40,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 12:34:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-04 12:34:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-04 12:34:40,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:40,913 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-10-04 12:34:40,913 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:40,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:40,913 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-10-04 12:34:40,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:40,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:40,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:40,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:40,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:41,740 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-04 12:34:41,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:41,740 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-04 12:34:41,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:41,786 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:41,786 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:41,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:41,793 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-04 12:34:41,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:41,801 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-04 12:34:41,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:42,897 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-04 12:34:42,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:42,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-10-04 12:34:42,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 12:34:42,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 12:34:42,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 12:34:42,919 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-10-04 12:34:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:43,223 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-04 12:34:43,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 12:34:43,224 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-10-04 12:34:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:43,225 INFO L225 Difference]: With dead ends: 163 [2018-10-04 12:34:43,225 INFO L226 Difference]: Without dead ends: 162 [2018-10-04 12:34:43,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 12:34:43,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-04 12:34:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-10-04 12:34:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-04 12:34:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-04 12:34:43,232 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-10-04 12:34:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:43,232 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-04 12:34:43,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 12:34:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-04 12:34:43,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-04 12:34:43,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:43,234 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-10-04 12:34:43,234 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:43,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:43,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-10-04 12:34:43,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:43,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:43,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:43,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:43,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:44,917 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-04 12:34:44,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:44,918 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-04 12:34:44,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:45,243 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-04 12:34:45,243 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:45,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:45,249 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-04 12:34:45,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:45,259 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-04 12:34:45,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:46,319 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-04 12:34:46,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:46,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-10-04 12:34:46,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 12:34:46,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 12:34:46,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 12:34:46,341 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-10-04 12:34:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:46,608 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-04 12:34:46,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 12:34:46,608 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-10-04 12:34:46,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:46,610 INFO L225 Difference]: With dead ends: 167 [2018-10-04 12:34:46,610 INFO L226 Difference]: Without dead ends: 166 [2018-10-04 12:34:46,611 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-04 12:34:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-04 12:34:46,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-10-04 12:34:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-04 12:34:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-04 12:34:46,617 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-10-04 12:34:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:46,617 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-04 12:34:46,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 12:34:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-04 12:34:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-04 12:34:46,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:46,618 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-10-04 12:34:46,618 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:46,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:46,619 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-10-04 12:34:46,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:46,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:46,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:46,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:46,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:49,620 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-04 12:34:49,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:49,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 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-04 12:34:49,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:49,671 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:49,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:49,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:49,696 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-04 12:34:49,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:49,720 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-04 12:34:49,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:50,847 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-04 12:34:50,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:50,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-10-04 12:34:50,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-04 12:34:50,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-04 12:34:50,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-04 12:34:50,869 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-10-04 12:34:51,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:51,291 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-04 12:34:51,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:34:51,291 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-10-04 12:34:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:51,293 INFO L225 Difference]: With dead ends: 171 [2018-10-04 12:34:51,293 INFO L226 Difference]: Without dead ends: 170 [2018-10-04 12:34:51,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-04 12:34:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-04 12:34:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-10-04 12:34:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-04 12:34:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-04 12:34:51,298 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-10-04 12:34:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:51,298 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-04 12:34:51,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-04 12:34:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-04 12:34:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-04 12:34:51,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:51,299 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-10-04 12:34:51,299 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:51,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:51,300 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-10-04 12:34:51,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:51,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:51,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:51,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:52,833 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-04 12:34:52,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:52,834 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-04 12:34:52,848 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:53,008 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-04 12:34:53,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:53,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:53,030 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-04 12:34:53,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:53,119 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-04 12:34:53,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:54,413 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-04 12:34:54,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:54,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-10-04 12:34:54,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-04 12:34:54,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-04 12:34:54,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-04 12:34:54,435 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-10-04 12:34:54,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:54,775 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-04 12:34:54,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 12:34:54,775 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-10-04 12:34:54,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:54,776 INFO L225 Difference]: With dead ends: 175 [2018-10-04 12:34:54,777 INFO L226 Difference]: Without dead ends: 174 [2018-10-04 12:34:54,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-04 12:34:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-04 12:34:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-10-04 12:34:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-04 12:34:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-04 12:34:54,783 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-10-04 12:34:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:54,783 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-04 12:34:54,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-04 12:34:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-04 12:34:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-04 12:34:54,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:54,784 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-10-04 12:34:54,784 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:54,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:54,785 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-10-04 12:34:54,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:54,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:54,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:54,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:54,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:56,910 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-04 12:34:56,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:56,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 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-04 12:34:56,924 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:57,103 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-04 12:34:57,103 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:57,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:57,116 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-04 12:34:57,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:57,124 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-04 12:34:57,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:58,292 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-04 12:34:58,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:58,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-10-04 12:34:58,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-04 12:34:58,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-04 12:34:58,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-04 12:34:58,315 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-10-04 12:34:58,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:58,926 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-04 12:34:58,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:34:58,927 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-10-04 12:34:58,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:58,928 INFO L225 Difference]: With dead ends: 179 [2018-10-04 12:34:58,928 INFO L226 Difference]: Without dead ends: 178 [2018-10-04 12:34:58,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-04 12:34:58,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-04 12:34:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-10-04 12:34:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-04 12:34:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-04 12:34:58,934 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-10-04 12:34:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:58,935 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-04 12:34:58,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-04 12:34:58,935 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-04 12:34:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-04 12:34:58,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:58,936 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-10-04 12:34:58,936 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:58,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-10-04 12:34:58,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:58,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:58,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:58,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:58,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:00,365 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-04 12:35:00,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:00,366 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-04 12:35:00,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:00,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:00,423 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-04 12:35:00,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:00,435 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-04 12:35:00,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:01,676 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-04 12:35:01,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:01,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-10-04 12:35:01,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-04 12:35:01,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-04 12:35:01,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-04 12:35:01,699 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-10-04 12:35:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:01,978 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-10-04 12:35:01,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 12:35:01,979 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-10-04 12:35:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:01,980 INFO L225 Difference]: With dead ends: 183 [2018-10-04 12:35:01,980 INFO L226 Difference]: Without dead ends: 182 [2018-10-04 12:35:01,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-04 12:35:01,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-04 12:35:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-10-04 12:35:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-04 12:35:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-04 12:35:01,986 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-10-04 12:35:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:01,986 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-04 12:35:01,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-04 12:35:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-04 12:35:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-04 12:35:01,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:01,988 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-10-04 12:35:01,988 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:01,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:01,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-10-04 12:35:01,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:01,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:01,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:01,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:01,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:03,365 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-04 12:35:03,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:03,366 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-04 12:35:03,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:03,418 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:03,419 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:03,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:03,428 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-04 12:35:03,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:03,441 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-04 12:35:03,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:05,090 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-04 12:35:05,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:05,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-10-04 12:35:05,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 12:35:05,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 12:35:05,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-04 12:35:05,112 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-10-04 12:35:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:05,394 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-04 12:35:05,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 12:35:05,395 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-10-04 12:35:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:05,396 INFO L225 Difference]: With dead ends: 187 [2018-10-04 12:35:05,396 INFO L226 Difference]: Without dead ends: 186 [2018-10-04 12:35:05,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-04 12:35:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-04 12:35:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-04 12:35:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-04 12:35:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-04 12:35:05,403 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-10-04 12:35:05,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:05,403 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-04 12:35:05,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 12:35:05,403 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-04 12:35:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-04 12:35:05,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:05,404 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-10-04 12:35:05,405 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:05,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:05,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-10-04 12:35:05,405 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:05,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:05,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:05,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:05,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:06,572 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-04 12:35:06,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:06,572 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:35:06,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:06,743 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-04 12:35:06,743 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:06,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:06,755 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-04 12:35:06,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:06,763 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-04 12:35:06,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:08,099 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-04 12:35:08,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:08,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-10-04 12:35:08,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-04 12:35:08,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-04 12:35:08,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-04 12:35:08,121 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-10-04 12:35:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:08,427 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-04 12:35:08,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:35:08,428 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-10-04 12:35:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:08,429 INFO L225 Difference]: With dead ends: 191 [2018-10-04 12:35:08,429 INFO L226 Difference]: Without dead ends: 190 [2018-10-04 12:35:08,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-04 12:35:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-04 12:35:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-10-04 12:35:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-04 12:35:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-04 12:35:08,434 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-10-04 12:35:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:08,434 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-04 12:35:08,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-04 12:35:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-04 12:35:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-04 12:35:08,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:08,435 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-10-04 12:35:08,435 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:08,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:08,435 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-10-04 12:35:08,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:08,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:08,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:08,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:08,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:10,076 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-04 12:35:10,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:10,076 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-04 12:35:10,102 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:10,155 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:10,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:10,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:10,177 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-04 12:35:10,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:10,203 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-04 12:35:10,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:12,623 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-04 12:35:12,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:12,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-10-04 12:35:12,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-04 12:35:12,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-04 12:35:12,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-04 12:35:12,646 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-10-04 12:35:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:13,114 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-04 12:35:13,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 12:35:13,115 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-10-04 12:35:13,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:13,117 INFO L225 Difference]: With dead ends: 195 [2018-10-04 12:35:13,117 INFO L226 Difference]: Without dead ends: 194 [2018-10-04 12:35:13,118 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-04 12:35:13,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-04 12:35:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-10-04 12:35:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-04 12:35:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-04 12:35:13,123 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-10-04 12:35:13,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:13,124 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-04 12:35:13,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-04 12:35:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-04 12:35:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-04 12:35:13,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:13,125 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-10-04 12:35:13,125 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:13,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:13,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-10-04 12:35:13,126 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:13,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:13,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:13,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:13,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:14,527 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-04 12:35:14,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:14,527 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-04 12:35:14,535 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:14,669 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-04 12:35:14,669 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:14,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:14,691 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-04 12:35:14,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:14,732 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-04 12:35:14,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:16,349 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-04 12:35:16,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:16,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-10-04 12:35:16,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-04 12:35:16,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-04 12:35:16,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-04 12:35:16,372 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-10-04 12:35:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:16,810 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-04 12:35:16,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 12:35:16,810 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-10-04 12:35:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:16,812 INFO L225 Difference]: With dead ends: 199 [2018-10-04 12:35:16,812 INFO L226 Difference]: Without dead ends: 198 [2018-10-04 12:35:16,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-04 12:35:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-04 12:35:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-10-04 12:35:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-04 12:35:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-04 12:35:16,818 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-10-04 12:35:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:16,818 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-04 12:35:16,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-04 12:35:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-04 12:35:16,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-04 12:35:16,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:16,819 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-10-04 12:35:16,820 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:16,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:16,820 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-10-04 12:35:16,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:16,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:16,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:16,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:16,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:18,248 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-04 12:35:18,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:18,248 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-04 12:35:18,256 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:18,411 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-04 12:35:18,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:18,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:18,418 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-04 12:35:18,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:18,427 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-04 12:35:18,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:20,030 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-04 12:35:20,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:20,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-10-04 12:35:20,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-04 12:35:20,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-04 12:35:20,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-04 12:35:20,052 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-10-04 12:35:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:20,434 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-04 12:35:20,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 12:35:20,435 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-10-04 12:35:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:20,436 INFO L225 Difference]: With dead ends: 203 [2018-10-04 12:35:20,436 INFO L226 Difference]: Without dead ends: 202 [2018-10-04 12:35:20,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-04 12:35:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-04 12:35:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-10-04 12:35:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-04 12:35:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-04 12:35:20,442 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-10-04 12:35:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:20,442 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-04 12:35:20,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-04 12:35:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-04 12:35:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-04 12:35:20,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:20,443 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-10-04 12:35:20,443 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:20,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:20,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-10-04 12:35:20,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:20,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:20,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:20,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:20,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:21,789 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-04 12:35:21,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:21,789 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-04 12:35:21,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:21,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:21,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-04 12:35:21,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:21,865 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-04 12:35:21,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:23,483 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-04 12:35:23,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:23,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-10-04 12:35:23,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-04 12:35:23,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-04 12:35:23,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-04 12:35:23,504 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-10-04 12:35:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:23,830 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-04 12:35:23,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 12:35:23,831 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-10-04 12:35:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:23,833 INFO L225 Difference]: With dead ends: 207 [2018-10-04 12:35:23,833 INFO L226 Difference]: Without dead ends: 206 [2018-10-04 12:35:23,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-04 12:35:23,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-04 12:35:23,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-10-04 12:35:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-04 12:35:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-04 12:35:23,839 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-10-04 12:35:23,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:23,839 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-04 12:35:23,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-04 12:35:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-04 12:35:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-04 12:35:23,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:23,841 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-10-04 12:35:23,841 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:23,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:23,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-10-04 12:35:23,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:23,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:23,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:23,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:23,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:25,401 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-04 12:35:25,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:25,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 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-04 12:35:25,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:25,463 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:25,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:25,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:25,470 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-04 12:35:25,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:25,478 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-04 12:35:25,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:27,419 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-04 12:35:27,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:27,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-10-04 12:35:27,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-04 12:35:27,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-04 12:35:27,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-04 12:35:27,441 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-10-04 12:35:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:27,759 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-04 12:35:27,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 12:35:27,760 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-10-04 12:35:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:27,762 INFO L225 Difference]: With dead ends: 211 [2018-10-04 12:35:27,762 INFO L226 Difference]: Without dead ends: 210 [2018-10-04 12:35:27,762 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-04 12:35:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-04 12:35:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-10-04 12:35:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-04 12:35:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-04 12:35:27,767 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-10-04 12:35:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:27,768 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-04 12:35:27,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-04 12:35:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-04 12:35:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-04 12:35:27,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:27,769 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-10-04 12:35:27,769 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:27,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:27,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-10-04 12:35:27,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:27,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:27,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:27,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:27,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:29,205 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-04 12:35:29,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:29,205 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:35:29,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:29,580 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-04 12:35:29,580 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:29,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:29,605 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-04 12:35:29,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:29,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-04 12:35:29,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:31,561 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-04 12:35:31,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:31,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-10-04 12:35:31,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-04 12:35:31,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-04 12:35:31,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-04 12:35:31,584 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-10-04 12:35:31,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:31,928 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-04 12:35:31,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 12:35:31,928 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-10-04 12:35:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:31,930 INFO L225 Difference]: With dead ends: 215 [2018-10-04 12:35:31,930 INFO L226 Difference]: Without dead ends: 214 [2018-10-04 12:35:31,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-04 12:35:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-04 12:35:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-10-04 12:35:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 12:35:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-04 12:35:31,936 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-10-04 12:35:31,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:31,937 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-04 12:35:31,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-04 12:35:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-04 12:35:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-04 12:35:31,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:31,938 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-10-04 12:35:31,938 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:31,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:31,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-10-04 12:35:31,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:31,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:31,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:31,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:31,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:33,487 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-04 12:35:33,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:33,487 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-04 12:35:33,495 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:33,550 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:33,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:33,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:33,579 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-04 12:35:33,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:33,612 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-04 12:35:33,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:35,644 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-04 12:35:35,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:35,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-10-04 12:35:35,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-04 12:35:35,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-04 12:35:35,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-04 12:35:35,666 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-10-04 12:35:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:36,013 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-04 12:35:36,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 12:35:36,013 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-10-04 12:35:36,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:36,015 INFO L225 Difference]: With dead ends: 219 [2018-10-04 12:35:36,015 INFO L226 Difference]: Without dead ends: 218 [2018-10-04 12:35:36,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-04 12:35:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-04 12:35:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-10-04 12:35:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-04 12:35:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-04 12:35:36,020 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-10-04 12:35:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:36,020 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-04 12:35:36,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-04 12:35:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-04 12:35:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-04 12:35:36,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:36,021 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-10-04 12:35:36,022 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:36,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:36,022 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-10-04 12:35:36,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:36,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:36,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:36,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:36,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:37,479 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-04 12:35:37,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:37,480 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-04 12:35:37,488 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:37,627 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-04 12:35:37,627 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:37,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:37,637 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-04 12:35:37,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:37,647 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-04 12:35:37,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:39,428 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-04 12:35:39,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:39,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-10-04 12:35:39,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-04 12:35:39,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-04 12:35:39,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-04 12:35:39,450 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-10-04 12:35:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:39,824 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-04 12:35:39,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 12:35:39,824 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-10-04 12:35:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:39,826 INFO L225 Difference]: With dead ends: 223 [2018-10-04 12:35:39,826 INFO L226 Difference]: Without dead ends: 222 [2018-10-04 12:35:39,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-04 12:35:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-04 12:35:39,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-10-04 12:35:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-04 12:35:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-04 12:35:39,831 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-10-04 12:35:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:39,831 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-04 12:35:39,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-04 12:35:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-04 12:35:39,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-04 12:35:39,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:39,832 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-10-04 12:35:39,832 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:39,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:39,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-10-04 12:35:39,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:39,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:39,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:41,643 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-04 12:35:41,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:41,644 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-04 12:35:41,651 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:41,831 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-04 12:35:41,831 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:41,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:41,851 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-04 12:35:41,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:41,860 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-04 12:35:41,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:43,733 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-04 12:35:43,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:43,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-10-04 12:35:43,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-04 12:35:43,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-04 12:35:43,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-04 12:35:43,756 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-10-04 12:35:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:44,082 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-04 12:35:44,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 12:35:44,082 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-10-04 12:35:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:44,084 INFO L225 Difference]: With dead ends: 227 [2018-10-04 12:35:44,084 INFO L226 Difference]: Without dead ends: 226 [2018-10-04 12:35:44,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-04 12:35:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-04 12:35:44,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-10-04 12:35:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-04 12:35:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-04 12:35:44,090 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-10-04 12:35:44,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:44,091 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-04 12:35:44,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-04 12:35:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-04 12:35:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-04 12:35:44,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:44,092 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-10-04 12:35:44,092 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:44,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:44,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-10-04 12:35:44,093 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:44,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:44,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:44,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:44,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:46,052 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-04 12:35:46,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:46,052 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-04 12:35:46,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:46,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:46,139 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-04 12:35:46,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:46,154 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-04 12:35:46,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:48,065 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-04 12:35:48,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:48,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-10-04 12:35:48,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-04 12:35:48,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-04 12:35:48,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-04 12:35:48,088 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-10-04 12:35:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:48,488 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-04 12:35:48,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 12:35:48,489 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-10-04 12:35:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:48,491 INFO L225 Difference]: With dead ends: 231 [2018-10-04 12:35:48,491 INFO L226 Difference]: Without dead ends: 230 [2018-10-04 12:35:48,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-04 12:35:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-04 12:35:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-10-04 12:35:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-04 12:35:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-10-04 12:35:48,497 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-10-04 12:35:48,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:48,497 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-10-04 12:35:48,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-04 12:35:48,498 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-10-04 12:35:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-04 12:35:48,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:48,499 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-10-04 12:35:48,499 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:48,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:48,499 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-10-04 12:35:48,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:48,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:48,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:48,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:48,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:50,145 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-04 12:35:50,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:50,146 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:35:50,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:50,224 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:50,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:50,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:50,235 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-04 12:35:50,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:50,244 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-04 12:35:50,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:52,475 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-04 12:35:52,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:52,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-10-04 12:35:52,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-04 12:35:52,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-04 12:35:52,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-04 12:35:52,498 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-10-04 12:35:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:52,920 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-04 12:35:52,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 12:35:52,921 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-10-04 12:35:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:52,922 INFO L225 Difference]: With dead ends: 235 [2018-10-04 12:35:52,922 INFO L226 Difference]: Without dead ends: 234 [2018-10-04 12:35:52,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-04 12:35:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-04 12:35:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-10-04 12:35:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-04 12:35:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-04 12:35:52,928 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-10-04 12:35:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:52,929 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-04 12:35:52,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-04 12:35:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-04 12:35:52,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-04 12:35:52,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:52,930 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-10-04 12:35:52,930 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:52,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:52,931 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-10-04 12:35:52,931 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:52,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:52,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:52,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:52,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:55,095 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-04 12:35:55,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:55,095 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:35:55,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:55,348 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-04 12:35:55,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:55,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:55,360 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-04 12:35:55,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:55,371 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-04 12:35:55,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:57,928 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-04 12:35:57,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:57,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-10-04 12:35:57,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-04 12:35:57,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-04 12:35:57,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-04 12:35:57,951 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-10-04 12:35:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:58,380 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-04 12:35:58,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 12:35:58,381 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-10-04 12:35:58,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:58,382 INFO L225 Difference]: With dead ends: 239 [2018-10-04 12:35:58,382 INFO L226 Difference]: Without dead ends: 238 [2018-10-04 12:35:58,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-04 12:35:58,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-04 12:35:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-10-04 12:35:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-04 12:35:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-04 12:35:58,387 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-10-04 12:35:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:58,387 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-04 12:35:58,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-04 12:35:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-04 12:35:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-04 12:35:58,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:58,388 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-10-04 12:35:58,388 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:58,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-10-04 12:35:58,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:58,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:58,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:58,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:58,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:00,129 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-04 12:36:00,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:00,130 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:36:00,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:00,210 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:00,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:00,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:00,222 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-04 12:36:00,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:00,233 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-04 12:36:00,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:02,652 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-04 12:36:02,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:02,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-10-04 12:36:02,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-04 12:36:02,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-04 12:36:02,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-04 12:36:02,675 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-10-04 12:36:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:03,118 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-10-04 12:36:03,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 12:36:03,119 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-10-04 12:36:03,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:03,121 INFO L225 Difference]: With dead ends: 243 [2018-10-04 12:36:03,121 INFO L226 Difference]: Without dead ends: 242 [2018-10-04 12:36:03,122 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-04 12:36:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-04 12:36:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-10-04 12:36:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-04 12:36:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-04 12:36:03,126 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-10-04 12:36:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:03,126 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-04 12:36:03,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-04 12:36:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-04 12:36:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-04 12:36:03,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:03,128 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-10-04 12:36:03,128 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:03,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:03,128 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-10-04 12:36:03,128 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:03,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:03,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:03,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:03,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:05,100 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-04 12:36:05,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:05,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 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-04 12:36:05,109 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:05,272 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-04 12:36:05,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:05,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:05,285 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-04 12:36:05,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:05,297 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-04 12:36:05,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:07,715 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-04 12:36:07,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:07,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-10-04 12:36:07,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-04 12:36:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-04 12:36:07,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-04 12:36:07,738 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-10-04 12:36:08,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:08,130 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-04 12:36:08,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 12:36:08,130 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-10-04 12:36:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:08,132 INFO L225 Difference]: With dead ends: 247 [2018-10-04 12:36:08,132 INFO L226 Difference]: Without dead ends: 246 [2018-10-04 12:36:08,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-04 12:36:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-04 12:36:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-10-04 12:36:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-04 12:36:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-04 12:36:08,139 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-10-04 12:36:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:08,139 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-04 12:36:08,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-04 12:36:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-04 12:36:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-04 12:36:08,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:08,140 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-10-04 12:36:08,141 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:08,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-10-04 12:36:08,141 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:08,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:08,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:08,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:08,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:09,958 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-04 12:36:09,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:09,959 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-04 12:36:09,967 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:10,185 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-04 12:36:10,185 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:10,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:10,197 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-04 12:36:10,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:10,211 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-04 12:36:10,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:12,730 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-04 12:36:12,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:12,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-10-04 12:36:12,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-04 12:36:12,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-04 12:36:12,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-04 12:36:12,752 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-10-04 12:36:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:13,275 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-04 12:36:13,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 12:36:13,276 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-10-04 12:36:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:13,278 INFO L225 Difference]: With dead ends: 251 [2018-10-04 12:36:13,278 INFO L226 Difference]: Without dead ends: 250 [2018-10-04 12:36:13,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-04 12:36:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-04 12:36:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-10-04 12:36:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-04 12:36:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-04 12:36:13,285 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-10-04 12:36:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:13,286 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-04 12:36:13,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-04 12:36:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-04 12:36:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-04 12:36:13,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:13,287 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-10-04 12:36:13,288 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:13,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:13,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-10-04 12:36:13,288 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:13,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:13,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:13,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:13,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:15,207 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-04 12:36:15,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:15,207 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:36:15,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:15,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:15,286 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-04 12:36:15,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:15,297 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-04 12:36:15,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:17,968 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-04 12:36:17,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:17,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-10-04 12:36:17,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-04 12:36:17,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-04 12:36:17,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-04 12:36:17,992 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-10-04 12:36:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:18,428 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-10-04 12:36:18,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 12:36:18,428 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-10-04 12:36:18,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:18,430 INFO L225 Difference]: With dead ends: 255 [2018-10-04 12:36:18,430 INFO L226 Difference]: Without dead ends: 254 [2018-10-04 12:36:18,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-04 12:36:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-04 12:36:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-10-04 12:36:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-04 12:36:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-04 12:36:18,435 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-10-04 12:36:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:18,436 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-04 12:36:18,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-04 12:36:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-04 12:36:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-04 12:36:18,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:18,437 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-10-04 12:36:18,437 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:18,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-10-04 12:36:18,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:18,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:18,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:20,371 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-04 12:36:20,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:20,371 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:36:20,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:20,441 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:20,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:20,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:20,450 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-04 12:36:20,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:20,461 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-04 12:36:20,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:23,054 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-04 12:36:23,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:23,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-10-04 12:36:23,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-04 12:36:23,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-04 12:36:23,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-04 12:36:23,076 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-10-04 12:36:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:23,516 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-04 12:36:23,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 12:36:23,516 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-10-04 12:36:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:23,518 INFO L225 Difference]: With dead ends: 259 [2018-10-04 12:36:23,518 INFO L226 Difference]: Without dead ends: 258 [2018-10-04 12:36:23,519 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-04 12:36:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-04 12:36:23,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-10-04 12:36:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-04 12:36:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-04 12:36:23,523 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-10-04 12:36:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:23,523 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-04 12:36:23,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-04 12:36:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-04 12:36:23,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-04 12:36:23,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:23,525 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-10-04 12:36:23,525 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:23,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:23,525 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-10-04 12:36:23,525 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:23,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:23,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:25,527 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-04 12:36:25,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:25,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 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-04 12:36:25,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:25,837 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-04 12:36:25,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:25,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:25,851 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-04 12:36:25,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:25,859 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-04 12:36:25,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:28,546 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-04 12:36:28,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:28,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-10-04 12:36:28,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-04 12:36:28,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-04 12:36:28,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-04 12:36:28,569 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-10-04 12:36:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:29,034 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-04 12:36:29,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-04 12:36:29,034 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-10-04 12:36:29,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:29,036 INFO L225 Difference]: With dead ends: 263 [2018-10-04 12:36:29,036 INFO L226 Difference]: Without dead ends: 262 [2018-10-04 12:36:29,037 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-04 12:36:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-04 12:36:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-10-04 12:36:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-04 12:36:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-04 12:36:29,044 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-10-04 12:36:29,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:29,044 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-04 12:36:29,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-04 12:36:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-04 12:36:29,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-04 12:36:29,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:29,046 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-10-04 12:36:29,046 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:29,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:29,046 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-10-04 12:36:29,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:29,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:29,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:29,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:29,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:31,141 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-04 12:36:31,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:31,142 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-04 12:36:31,149 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:31,223 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:31,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:31,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:31,237 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-04 12:36:31,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:31,250 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-04 12:36:31,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:34,219 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-04 12:36:34,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:34,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-10-04 12:36:34,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-04 12:36:34,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-04 12:36:34,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-04 12:36:34,241 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-10-04 12:36:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:34,717 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-10-04 12:36:34,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 12:36:34,717 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-10-04 12:36:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:34,719 INFO L225 Difference]: With dead ends: 267 [2018-10-04 12:36:34,719 INFO L226 Difference]: Without dead ends: 266 [2018-10-04 12:36:34,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-04 12:36:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-04 12:36:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-10-04 12:36:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-04 12:36:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-10-04 12:36:34,725 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-10-04 12:36:34,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:34,725 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-10-04 12:36:34,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-04 12:36:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-10-04 12:36:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-04 12:36:34,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:34,727 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-10-04 12:36:34,727 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:34,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:34,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-10-04 12:36:34,727 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:34,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:34,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:34,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:34,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:37,180 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-04 12:36:37,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:37,181 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-04 12:36:37,188 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:37,374 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-04 12:36:37,374 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:37,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:37,385 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-04 12:36:37,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:37,395 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-04 12:36:37,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:40,032 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-04 12:36:40,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:40,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-10-04 12:36:40,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-04 12:36:40,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-04 12:36:40,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-04 12:36:40,055 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-10-04 12:36:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:40,553 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-04 12:36:40,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 12:36:40,553 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-10-04 12:36:40,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:40,555 INFO L225 Difference]: With dead ends: 271 [2018-10-04 12:36:40,555 INFO L226 Difference]: Without dead ends: 270 [2018-10-04 12:36:40,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-04 12:36:40,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-04 12:36:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-10-04 12:36:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-04 12:36:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-10-04 12:36:40,561 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-10-04 12:36:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:40,562 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-10-04 12:36:40,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-04 12:36:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-10-04 12:36:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-04 12:36:40,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:40,563 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-10-04 12:36:40,564 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:40,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:40,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-10-04 12:36:40,564 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:40,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:40,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:40,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:40,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:43,045 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-04 12:36:43,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:43,045 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-04 12:36:43,053 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:43,302 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-04 12:36:43,302 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:43,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:43,312 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-04 12:36:43,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:43,320 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-04 12:36:43,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:46,024 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-04 12:36:46,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:46,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-10-04 12:36:46,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-04 12:36:46,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-04 12:36:46,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-04 12:36:46,048 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-10-04 12:36:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:46,585 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-04 12:36:46,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 12:36:46,586 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-10-04 12:36:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:46,587 INFO L225 Difference]: With dead ends: 275 [2018-10-04 12:36:46,588 INFO L226 Difference]: Without dead ends: 274 [2018-10-04 12:36:46,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-04 12:36:46,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-04 12:36:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-10-04 12:36:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-04 12:36:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-04 12:36:46,593 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-10-04 12:36:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:46,593 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-04 12:36:46,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-04 12:36:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-04 12:36:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-04 12:36:46,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:46,594 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-10-04 12:36:46,595 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:46,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-10-04 12:36:46,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:46,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:46,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:46,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:46,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:49,113 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-04 12:36:49,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:49,114 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-04 12:36:49,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:49,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:49,195 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-04 12:36:49,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:49,208 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-04 12:36:49,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:51,991 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-04 12:36:52,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:52,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-10-04 12:36:52,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-04 12:36:52,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-04 12:36:52,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-04 12:36:52,013 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-10-04 12:36:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:52,474 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-04 12:36:52,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 12:36:52,475 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-10-04 12:36:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:52,476 INFO L225 Difference]: With dead ends: 279 [2018-10-04 12:36:52,476 INFO L226 Difference]: Without dead ends: 278 [2018-10-04 12:36:52,477 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-04 12:36:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-04 12:36:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-10-04 12:36:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-04 12:36:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-04 12:36:52,483 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-10-04 12:36:52,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:52,483 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-04 12:36:52,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-04 12:36:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-04 12:36:52,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-04 12:36:52,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:52,485 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-10-04 12:36:52,485 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:52,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:52,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-10-04 12:36:52,485 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:52,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:52,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:52,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:52,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:54,808 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-04 12:36:54,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:54,808 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-04 12:36:54,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:54,885 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:54,885 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:54,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:54,894 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-04 12:36:54,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:54,908 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-04 12:36:54,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:58,003 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-04 12:36:58,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:58,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-10-04 12:36:58,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-04 12:36:58,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-04 12:36:58,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-04 12:36:58,026 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-10-04 12:36:58,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:58,545 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-04 12:36:58,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 12:36:58,545 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-10-04 12:36:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:58,547 INFO L225 Difference]: With dead ends: 283 [2018-10-04 12:36:58,547 INFO L226 Difference]: Without dead ends: 282 [2018-10-04 12:36:58,548 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-04 12:36:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-04 12:36:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-10-04 12:36:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-04 12:36:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-04 12:36:58,554 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-10-04 12:36:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:58,554 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-04 12:36:58,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-10-04 12:36:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-04 12:36:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-04 12:36:58,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:58,556 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-10-04 12:36:58,556 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:58,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:58,556 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-10-04 12:36:58,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:58,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:58,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:58,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:58,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:00,916 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-04 12:37:00,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:00,916 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-04 12:37:00,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:37:01,283 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-04 12:37:01,284 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:01,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:01,292 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-04 12:37:01,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:01,304 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-04 12:37:01,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:04,425 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-04 12:37:04,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:04,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-10-04 12:37:04,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-10-04 12:37:04,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-10-04 12:37:04,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-04 12:37:04,450 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-10-04 12:37:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:04,922 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-04 12:37:04,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 12:37:04,923 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-10-04 12:37:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:04,924 INFO L225 Difference]: With dead ends: 287 [2018-10-04 12:37:04,925 INFO L226 Difference]: Without dead ends: 286 [2018-10-04 12:37:04,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-04 12:37:04,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-04 12:37:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-10-04 12:37:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-04 12:37:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-10-04 12:37:04,930 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-10-04 12:37:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:04,930 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-10-04 12:37:04,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-10-04 12:37:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-10-04 12:37:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-04 12:37:04,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:04,932 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-10-04 12:37:04,932 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:04,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-10-04 12:37:04,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:04,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:04,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:04,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:07,513 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-04 12:37:07,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:07,513 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-04 12:37:07,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:37:07,602 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:37:07,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:07,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:07,612 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-04 12:37:07,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:07,624 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-04 12:37:07,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:10,543 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-04 12:37:10,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:10,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-10-04 12:37:10,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-10-04 12:37:10,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-10-04 12:37:10,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-04 12:37:10,566 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-10-04 12:37:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:11,159 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-04 12:37:11,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-04 12:37:11,159 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-10-04 12:37:11,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:11,161 INFO L225 Difference]: With dead ends: 291 [2018-10-04 12:37:11,161 INFO L226 Difference]: Without dead ends: 290 [2018-10-04 12:37:11,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-04 12:37:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-04 12:37:11,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-10-04 12:37:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-04 12:37:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-10-04 12:37:11,167 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-10-04 12:37:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:11,167 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-10-04 12:37:11,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-10-04 12:37:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-10-04 12:37:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-04 12:37:11,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:11,168 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-10-04 12:37:11,169 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:11,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:11,169 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-10-04 12:37:11,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:11,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:11,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:11,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:11,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:13,985 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-04 12:37:13,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:13,986 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-04 12:37:13,993 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:37:14,205 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-04 12:37:14,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:14,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:14,215 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-04 12:37:14,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:14,225 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-04 12:37:14,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:17,223 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-04 12:37:17,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:17,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-10-04 12:37:17,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-10-04 12:37:17,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-10-04 12:37:17,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-04 12:37:17,248 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-10-04 12:37:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:17,869 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-04 12:37:17,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 12:37:17,869 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-10-04 12:37:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:17,871 INFO L225 Difference]: With dead ends: 295 [2018-10-04 12:37:17,871 INFO L226 Difference]: Without dead ends: 294 [2018-10-04 12:37:17,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-04 12:37:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-04 12:37:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-10-04 12:37:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-04 12:37:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-04 12:37:17,877 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-10-04 12:37:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:17,877 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-04 12:37:17,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-10-04 12:37:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-04 12:37:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-04 12:37:17,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:17,878 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-10-04 12:37:17,878 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:17,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:17,879 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-10-04 12:37:17,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:17,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:17,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:17,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:17,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:20,487 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-04 12:37:20,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:20,488 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-04 12:37:20,494 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:37:20,802 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-04 12:37:20,803 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:20,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:20,813 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-04 12:37:20,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:20,823 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-04 12:37:20,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:23,989 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-04 12:37:24,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:24,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-10-04 12:37:24,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-10-04 12:37:24,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-10-04 12:37:24,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-04 12:37:24,014 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-10-04 12:37:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:24,511 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-04 12:37:24,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-04 12:37:24,512 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-10-04 12:37:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:24,514 INFO L225 Difference]: With dead ends: 299 [2018-10-04 12:37:24,514 INFO L226 Difference]: Without dead ends: 298 [2018-10-04 12:37:24,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-04 12:37:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-04 12:37:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-10-04 12:37:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-04 12:37:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-04 12:37:24,520 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-10-04 12:37:24,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:24,520 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-04 12:37:24,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-10-04 12:37:24,520 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-04 12:37:24,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-04 12:37:24,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:24,521 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-10-04 12:37:24,521 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:24,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:24,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-10-04 12:37:24,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:24,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:24,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:24,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:24,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:27,280 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-04 12:37:27,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:27,281 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-04 12:37:27,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:37:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:27,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:27,370 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-04 12:37:27,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:27,381 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-04 12:37:27,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:30,665 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-04 12:37:30,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:30,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-10-04 12:37:30,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-10-04 12:37:30,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-10-04 12:37:30,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-04 12:37:30,689 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-10-04 12:37:31,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:31,180 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-10-04 12:37:31,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 12:37:31,181 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-10-04 12:37:31,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:31,182 INFO L225 Difference]: With dead ends: 303 [2018-10-04 12:37:31,182 INFO L226 Difference]: Without dead ends: 302 [2018-10-04 12:37:31,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-04 12:37:31,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-04 12:37:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-10-04 12:37:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-04 12:37:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-04 12:37:31,190 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-10-04 12:37:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:31,191 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-04 12:37:31,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-10-04 12:37:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-04 12:37:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-04 12:37:31,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:31,192 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-10-04 12:37:31,192 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:31,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:31,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-10-04 12:37:31,193 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:31,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:31,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:31,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:37:31,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:33,999 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-04 12:37:34,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:34,000 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-04 12:37:34,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:37:34,078 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:37:34,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:34,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:34,086 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-04 12:37:34,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:34,095 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-04 12:37:34,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:37,356 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-04 12:37:37,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:37,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-10-04 12:37:37,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-10-04 12:37:37,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-10-04 12:37:37,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-04 12:37:37,380 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-10-04 12:37:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:37,897 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-04 12:37:37,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 12:37:37,897 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-10-04 12:37:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:37,899 INFO L225 Difference]: With dead ends: 307 [2018-10-04 12:37:37,899 INFO L226 Difference]: Without dead ends: 306 [2018-10-04 12:37:37,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-04 12:37:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-04 12:37:37,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-10-04 12:37:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-04 12:37:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-04 12:37:37,906 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-10-04 12:37:37,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:37,906 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-04 12:37:37,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-10-04 12:37:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-04 12:37:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-04 12:37:37,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:37,907 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-10-04 12:37:37,907 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:37,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:37,907 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-10-04 12:37:37,907 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:37,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:37,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:37,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:37,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:40,735 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-04 12:37:40,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:40,735 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-04 12:37:40,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:37:41,169 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-04 12:37:41,169 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:41,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:41,179 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-04 12:37:41,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:41,189 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-04 12:37:41,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:44,480 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-04 12:37:44,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:44,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2018-10-04 12:37:44,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-10-04 12:37:44,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-10-04 12:37:44,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-04 12:37:44,504 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2018-10-04 12:37:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:45,049 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-04 12:37:45,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-04 12:37:45,050 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2018-10-04 12:37:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:45,051 INFO L225 Difference]: With dead ends: 311 [2018-10-04 12:37:45,051 INFO L226 Difference]: Without dead ends: 310 [2018-10-04 12:37:45,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-04 12:37:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-04 12:37:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-10-04 12:37:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-04 12:37:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-10-04 12:37:45,057 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2018-10-04 12:37:45,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:45,057 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-10-04 12:37:45,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-10-04 12:37:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-10-04 12:37:45,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-04 12:37:45,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:45,058 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2018-10-04 12:37:45,058 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:45,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:45,059 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2018-10-04 12:37:45,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:45,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:45,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:45,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:45,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:47,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:47,972 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:47,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:37:48,070 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:37:48,070 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:48,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:48,079 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-04 12:37:48,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:48,087 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-04 12:37:48,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 Received shutdown request... [2018-10-04 12:37:48,861 WARN L186 SmtUtils]: Removed 2 from assertion stack [2018-10-04 12:37:48,861 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-04 12:37:49,062 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:49,062 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:37:49,067 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:37:49,068 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:37:49 BoogieIcfgContainer [2018-10-04 12:37:49,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:37:49,068 INFO L168 Benchmark]: Toolchain (without parser) took 240168.01 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 975.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:37:49,070 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-04 12:37:49,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.40 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-04 12:37:49,070 INFO L168 Benchmark]: Boogie Preprocessor took 28.73 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-04 12:37:49,070 INFO L168 Benchmark]: RCFGBuilder took 335.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:37:49,071 INFO L168 Benchmark]: TraceAbstraction took 239734.96 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 954.6 MB. Max. memory is 7.1 GB. [2018-10-04 12:37:49,072 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 64.40 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 28.73 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 335.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239734.96 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 954.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 309 with TraceHistMax 77, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 239.6s OverallTime, 77 OverallIterations, 77 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 4233 SDslu, 4298 SDs, 0 SdLazy, 16000 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14551 GetRequests, 8700 SyntacticMatches, 0 SemanticMatches, 5851 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292600 ImplicationChecksByTransitivity, 184.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=76, 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, 76 MinimizatonAttempts, 76 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 8.4s SatisfiabilityAnalysisTime, 196.8s 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-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-37-49-081.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-37-49-081.csv Completed graceful shutdown