java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b2fde6a [2018-09-28 10:15:32,850 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 10:15:32,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 10:15:32,867 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 10:15:32,867 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 10:15:32,869 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 10:15:32,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 10:15:32,880 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 10:15:32,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 10:15:32,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 10:15:32,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 10:15:32,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 10:15:32,885 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 10:15:32,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 10:15:32,887 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 10:15:32,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 10:15:32,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 10:15:32,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 10:15:32,892 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 10:15:32,894 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 10:15:32,895 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 10:15:32,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 10:15:32,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 10:15:32,899 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 10:15:32,899 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 10:15:32,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 10:15:32,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 10:15:32,902 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 10:15:32,903 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 10:15:32,904 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 10:15:32,904 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 10:15:32,905 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 10:15:32,905 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 10:15:32,905 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 10:15:32,906 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 10:15:32,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 10:15:32,907 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-09-28 10:15:32,932 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 10:15:32,932 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 10:15:32,933 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 10:15:32,933 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 10:15:32,934 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 10:15:32,934 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 10:15:32,934 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 10:15:32,934 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 10:15:32,934 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 10:15:32,934 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 10:15:32,935 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 10:15:32,935 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 10:15:32,935 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 10:15:32,935 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 10:15:32,935 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 10:15:32,936 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 10:15:32,936 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 10:15:32,936 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 10:15:32,936 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 10:15:32,936 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 10:15:32,937 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 10:15:32,937 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 10:15:32,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 10:15:32,937 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 10:15:32,937 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 10:15:32,938 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 10:15:32,938 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 10:15:32,938 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 10:15:32,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 10:15:32,938 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 10:15:32,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 10:15:32,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 10:15:32,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 10:15:33,000 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 10:15:33,001 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 10:15:33,002 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2018-09-28 10:15:33,003 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2018-09-28 10:15:33,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 10:15:33,083 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 10:15:33,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 10:15:33,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 10:15:33,084 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 10:15:33,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:33" (1/1) ... [2018-09-28 10:15:33,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:33" (1/1) ... [2018-09-28 10:15:33,132 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-28 10:15:33,133 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-28 10:15:33,133 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-28 10:15:33,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 10:15:33,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 10:15:33,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 10:15:33,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 10:15:33,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:33" (1/1) ... [2018-09-28 10:15:33,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:33" (1/1) ... [2018-09-28 10:15:33,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:33" (1/1) ... [2018-09-28 10:15:33,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:33" (1/1) ... [2018-09-28 10:15:33,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:33" (1/1) ... [2018-09-28 10:15:33,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:33" (1/1) ... [2018-09-28 10:15:33,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:33" (1/1) ... [2018-09-28 10:15:33,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 10:15:33,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 10:15:33,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 10:15:33,181 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 10:15:33,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 10:15:33,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-28 10:15:33,261 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-28 10:15:33,262 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-28 10:15:33,459 INFO L350 CfgBuilder]: Using library mode [2018-09-28 10:15:33,460 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:15:33 BoogieIcfgContainer [2018-09-28 10:15:33,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 10:15:33,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 10:15:33,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 10:15:33,472 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 10:15:33,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:33" (1/2) ... [2018-09-28 10:15:33,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e52177d and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.09 10:15:33, skipping insertion in model container [2018-09-28 10:15:33,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:15:33" (2/2) ... [2018-09-28 10:15:33,483 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2018-09-28 10:15:33,499 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 10:15:33,521 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-28 10:15:33,603 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 10:15:33,605 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 10:15:33,605 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 10:15:33,605 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 10:15:33,605 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 10:15:33,606 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 10:15:33,606 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 10:15:33,606 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 10:15:33,606 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 10:15:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-28 10:15:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-28 10:15:33,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:33,631 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-28 10:15:33,633 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:33,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:33,639 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-28 10:15:33,641 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:33,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:33,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:33,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:33,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:33,844 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:15:33,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-28 10:15:33,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:15:33,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:15:33,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:15:33,865 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-09-28 10:15:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:33,916 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-28 10:15:33,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:15:33,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-28 10:15:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:33,932 INFO L225 Difference]: With dead ends: 17 [2018-09-28 10:15:33,932 INFO L226 Difference]: Without dead ends: 10 [2018-09-28 10:15:33,936 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-09-28 10:15:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-28 10:15:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-09-28 10:15:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-28 10:15:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-28 10:15:33,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-09-28 10:15:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:33,971 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-28 10:15:33,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:15:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-28 10:15:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-28 10:15:33,972 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:33,972 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-28 10:15:33,972 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:33,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:33,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-09-28 10:15:33,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:33,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:33,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:33,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:33,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:34,073 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:34,073 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:34,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:34,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:34,183 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-09-28 10:15:34,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:34,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:34,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:34,326 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:34,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-09-28 10:15:34,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-28 10:15:34,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-28 10:15:34,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-28 10:15:34,328 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-28 10:15:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:34,455 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-28 10:15:34,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-28 10:15:34,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-28 10:15:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:34,457 INFO L225 Difference]: With dead ends: 15 [2018-09-28 10:15:34,457 INFO L226 Difference]: Without dead ends: 14 [2018-09-28 10:15:34,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-28 10:15:34,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-28 10:15:34,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-28 10:15:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-28 10:15:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-28 10:15:34,463 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-09-28 10:15:34,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:34,463 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-28 10:15:34,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-28 10:15:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-28 10:15:34,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 10:15:34,464 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:34,465 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-09-28 10:15:34,465 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:34,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:34,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-09-28 10:15:34,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:34,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:34,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:34,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:34,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:34,632 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:34,632 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:34,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:15:34,686 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:15:34,686 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:34,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:34,704 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-09-28 10:15:34,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:34,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:34,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:34,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:34,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-28 10:15:34,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 10:15:34,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 10:15:34,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-28 10:15:34,956 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-28 10:15:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:35,041 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-28 10:15:35,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-28 10:15:35,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 10:15:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:35,043 INFO L225 Difference]: With dead ends: 19 [2018-09-28 10:15:35,044 INFO L226 Difference]: Without dead ends: 18 [2018-09-28 10:15:35,044 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-09-28 10:15:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-28 10:15:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-28 10:15:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-28 10:15:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-28 10:15:35,050 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-09-28 10:15:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:35,051 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-28 10:15:35,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 10:15:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-28 10:15:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 10:15:35,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:35,052 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-09-28 10:15:35,052 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:35,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:35,053 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-09-28 10:15:35,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:35,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:35,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:35,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:35,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:35,223 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:35,223 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:35,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:15:35,307 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-28 10:15:35,307 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:35,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:35,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-09-28 10:15:35,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:35,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:35,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:35,477 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:35,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-28 10:15:35,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-28 10:15:35,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-28 10:15:35,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-28 10:15:35,480 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-28 10:15:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:35,571 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-28 10:15:35,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-28 10:15:35,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-28 10:15:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:35,573 INFO L225 Difference]: With dead ends: 23 [2018-09-28 10:15:35,574 INFO L226 Difference]: Without dead ends: 22 [2018-09-28 10:15:35,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-28 10:15:35,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-28 10:15:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-09-28 10:15:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-28 10:15:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-28 10:15:35,581 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-09-28 10:15:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:35,581 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-28 10:15:35,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-28 10:15:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-28 10:15:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-28 10:15:35,582 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:35,582 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-09-28 10:15:35,583 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:35,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:35,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-09-28 10:15:35,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:35,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:35,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:35,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:35,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:35,736 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:35,736 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:35,737 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:35,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:15:35,770 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:15:35,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:35,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:35,786 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-09-28 10:15:35,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:35,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:35,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:36,326 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:36,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-28 10:15:36,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-28 10:15:36,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-28 10:15:36,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-28 10:15:36,328 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-28 10:15:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:36,430 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-28 10:15:36,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-28 10:15:36,431 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-28 10:15:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:36,432 INFO L225 Difference]: With dead ends: 27 [2018-09-28 10:15:36,433 INFO L226 Difference]: Without dead ends: 26 [2018-09-28 10:15:36,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-28 10:15:36,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-28 10:15:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-28 10:15:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-28 10:15:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-28 10:15:36,439 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-09-28 10:15:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:36,440 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-28 10:15:36,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-28 10:15:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-28 10:15:36,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-28 10:15:36,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:36,442 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-09-28 10:15:36,443 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:36,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:36,444 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-09-28 10:15:36,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:36,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:36,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:36,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:36,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:36,592 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:36,592 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:36,602 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:15:36,619 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-28 10:15:36,620 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:36,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:36,631 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-09-28 10:15:36,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:36,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:36,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:36,775 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:36,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-28 10:15:36,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-28 10:15:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-28 10:15:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-28 10:15:36,777 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-28 10:15:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:36,854 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-28 10:15:36,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-28 10:15:36,855 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-28 10:15:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:36,856 INFO L225 Difference]: With dead ends: 31 [2018-09-28 10:15:36,857 INFO L226 Difference]: Without dead ends: 30 [2018-09-28 10:15:36,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-28 10:15:36,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-28 10:15:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-28 10:15:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-28 10:15:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-28 10:15:36,863 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-09-28 10:15:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:36,863 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-28 10:15:36,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-28 10:15:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-28 10:15:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-28 10:15:36,864 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:36,864 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-09-28 10:15:36,865 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:36,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:36,865 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-09-28 10:15:36,865 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:36,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:36,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:36,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:36,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:37,105 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:37,106 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:37,118 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:15:37,141 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-28 10:15:37,141 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:37,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:37,167 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-09-28 10:15:37,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:37,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:37,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:37,365 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:37,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-28 10:15:37,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-28 10:15:37,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-28 10:15:37,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-28 10:15:37,366 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-28 10:15:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:37,468 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-28 10:15:37,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-28 10:15:37,469 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-28 10:15:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:37,470 INFO L225 Difference]: With dead ends: 35 [2018-09-28 10:15:37,470 INFO L226 Difference]: Without dead ends: 34 [2018-09-28 10:15:37,471 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-09-28 10:15:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-28 10:15:37,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-28 10:15:37,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-28 10:15:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-28 10:15:37,477 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-09-28 10:15:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:37,477 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-28 10:15:37,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-28 10:15:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-28 10:15:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-28 10:15:37,478 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:37,479 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-09-28 10:15:37,479 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:37,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:37,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-09-28 10:15:37,480 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:37,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:37,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:37,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:37,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:37,639 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:37,639 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:37,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:37,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:37,682 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-09-28 10:15:37,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:37,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:37,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:37,912 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:37,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-28 10:15:37,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-28 10:15:37,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-28 10:15:37,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-28 10:15:37,914 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-28 10:15:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:38,049 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-28 10:15:38,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-28 10:15:38,050 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-28 10:15:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:38,052 INFO L225 Difference]: With dead ends: 39 [2018-09-28 10:15:38,052 INFO L226 Difference]: Without dead ends: 38 [2018-09-28 10:15:38,053 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-09-28 10:15:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-28 10:15:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-09-28 10:15:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-28 10:15:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-28 10:15:38,058 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-09-28 10:15:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:38,059 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-28 10:15:38,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-28 10:15:38,059 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-28 10:15:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-28 10:15:38,060 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:38,060 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-09-28 10:15:38,060 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:38,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:38,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-09-28 10:15:38,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:38,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:38,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:38,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:38,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:38,320 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:38,320 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:38,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:15:38,348 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:15:38,349 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:38,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:38,369 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-09-28 10:15:38,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:38,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:38,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:38,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:38,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-28 10:15:38,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-28 10:15:38,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-28 10:15:38,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-28 10:15:38,584 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-28 10:15:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:38,836 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-28 10:15:38,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-28 10:15:38,836 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-28 10:15:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:38,837 INFO L225 Difference]: With dead ends: 43 [2018-09-28 10:15:38,837 INFO L226 Difference]: Without dead ends: 42 [2018-09-28 10:15:38,838 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-09-28 10:15:38,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-28 10:15:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-28 10:15:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-28 10:15:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-28 10:15:38,844 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-09-28 10:15:38,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:38,845 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-28 10:15:38,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-28 10:15:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-28 10:15:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-28 10:15:38,846 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:38,846 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-09-28 10:15:38,847 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:38,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:38,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-09-28 10:15:38,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:38,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:38,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:38,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:38,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:39,014 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:39,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:39,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:15:39,165 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-28 10:15:39,166 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:39,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:39,186 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-09-28 10:15:39,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:39,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:39,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:39,836 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:39,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-28 10:15:39,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-28 10:15:39,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-28 10:15:39,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-28 10:15:39,838 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-09-28 10:15:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:39,940 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-28 10:15:39,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-28 10:15:39,940 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-09-28 10:15:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:39,942 INFO L225 Difference]: With dead ends: 47 [2018-09-28 10:15:39,942 INFO L226 Difference]: Without dead ends: 46 [2018-09-28 10:15:39,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-28 10:15:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-28 10:15:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-09-28 10:15:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-28 10:15:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-28 10:15:39,949 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-09-28 10:15:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:39,949 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-28 10:15:39,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-28 10:15:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-28 10:15:39,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-28 10:15:39,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:39,951 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-09-28 10:15:39,951 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:39,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:39,951 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-09-28 10:15:39,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:39,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:39,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:39,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:39,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:40,196 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:40,196 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:40,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:15:40,237 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:15:40,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:40,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:40,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-09-28 10:15:40,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:40,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:40,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:40,594 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:40,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-28 10:15:40,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-28 10:15:40,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-28 10:15:40,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-28 10:15:40,595 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-09-28 10:15:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:40,708 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-28 10:15:40,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-28 10:15:40,708 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-28 10:15:40,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:40,710 INFO L225 Difference]: With dead ends: 51 [2018-09-28 10:15:40,710 INFO L226 Difference]: Without dead ends: 50 [2018-09-28 10:15:40,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-28 10:15:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-28 10:15:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-09-28 10:15:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-28 10:15:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-28 10:15:40,716 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-09-28 10:15:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:40,717 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-28 10:15:40,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-28 10:15:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-28 10:15:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-28 10:15:40,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:40,718 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-09-28 10:15:40,718 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:40,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:40,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-09-28 10:15:40,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:40,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:40,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:40,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:40,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:40,978 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:40,979 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:40,987 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:15:41,052 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-28 10:15:41,053 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:41,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:41,070 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-09-28 10:15:41,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:41,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:41,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:41,483 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:41,483 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-28 10:15:41,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-28 10:15:41,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-28 10:15:41,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-28 10:15:41,484 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-09-28 10:15:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:41,607 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-28 10:15:41,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-28 10:15:41,607 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-09-28 10:15:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:41,609 INFO L225 Difference]: With dead ends: 55 [2018-09-28 10:15:41,609 INFO L226 Difference]: Without dead ends: 54 [2018-09-28 10:15:41,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-28 10:15:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-28 10:15:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-28 10:15:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-28 10:15:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-28 10:15:41,616 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-09-28 10:15:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:41,617 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-28 10:15:41,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-28 10:15:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-28 10:15:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-28 10:15:41,618 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:41,618 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-09-28 10:15:41,618 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:41,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:41,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-09-28 10:15:41,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:41,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:41,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:41,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:41,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:42,422 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:42,422 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:42,429 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:15:42,462 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-28 10:15:42,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:42,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:42,496 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-09-28 10:15:42,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:42,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:42,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:42,983 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:42,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-28 10:15:42,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-28 10:15:42,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-28 10:15:42,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-28 10:15:42,984 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-09-28 10:15:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:43,120 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-28 10:15:43,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-28 10:15:43,120 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-09-28 10:15:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:43,121 INFO L225 Difference]: With dead ends: 59 [2018-09-28 10:15:43,122 INFO L226 Difference]: Without dead ends: 58 [2018-09-28 10:15:43,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-28 10:15:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-28 10:15:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-09-28 10:15:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-28 10:15:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-28 10:15:43,129 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-09-28 10:15:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:43,130 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-28 10:15:43,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-28 10:15:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-28 10:15:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-28 10:15:43,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:43,131 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-09-28 10:15:43,131 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:43,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:43,132 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-09-28 10:15:43,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:43,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:43,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:43,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:43,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:43,588 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:43,589 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:43,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:43,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:43,633 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-09-28 10:15:43,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:43,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:43,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:43,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:43,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-28 10:15:43,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-28 10:15:43,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-28 10:15:43,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-28 10:15:43,968 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-09-28 10:15:44,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:44,196 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-28 10:15:44,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-28 10:15:44,196 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-09-28 10:15:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:44,197 INFO L225 Difference]: With dead ends: 63 [2018-09-28 10:15:44,197 INFO L226 Difference]: Without dead ends: 62 [2018-09-28 10:15:44,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-28 10:15:44,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-28 10:15:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-28 10:15:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-28 10:15:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-28 10:15:44,206 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-09-28 10:15:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:44,207 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-28 10:15:44,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-28 10:15:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-28 10:15:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-28 10:15:44,210 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:44,210 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-09-28 10:15:44,210 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:44,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:44,211 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-09-28 10:15:44,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:44,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:44,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:44,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:44,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:44,697 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:44,697 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:44,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:15:44,733 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:15:44,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:44,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:44,742 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-09-28 10:15:44,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:44,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:44,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:45,081 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:45,081 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-28 10:15:45,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-28 10:15:45,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-28 10:15:45,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-28 10:15:45,082 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-09-28 10:15:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:45,222 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-28 10:15:45,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-28 10:15:45,222 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-09-28 10:15:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:45,223 INFO L225 Difference]: With dead ends: 67 [2018-09-28 10:15:45,223 INFO L226 Difference]: Without dead ends: 66 [2018-09-28 10:15:45,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-28 10:15:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-28 10:15:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-09-28 10:15:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-28 10:15:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-28 10:15:45,230 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-09-28 10:15:45,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:45,231 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-28 10:15:45,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-28 10:15:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-28 10:15:45,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-28 10:15:45,232 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:45,232 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-09-28 10:15:45,232 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:45,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:45,233 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-09-28 10:15:45,233 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:45,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:45,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:45,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:45,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:45,628 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:45,629 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:45,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:15:45,677 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-28 10:15:45,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:45,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:45,693 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-09-28 10:15:45,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:45,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:45,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:46,017 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:46,017 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-28 10:15:46,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-28 10:15:46,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-28 10:15:46,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-28 10:15:46,018 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-09-28 10:15:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:46,298 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-28 10:15:46,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-28 10:15:46,299 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-09-28 10:15:46,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:46,300 INFO L225 Difference]: With dead ends: 71 [2018-09-28 10:15:46,300 INFO L226 Difference]: Without dead ends: 70 [2018-09-28 10:15:46,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-28 10:15:46,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-28 10:15:46,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-09-28 10:15:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-28 10:15:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-28 10:15:46,306 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-09-28 10:15:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:46,306 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-28 10:15:46,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-28 10:15:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-28 10:15:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-28 10:15:46,308 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:46,308 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-09-28 10:15:46,308 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:46,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:46,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-09-28 10:15:46,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:46,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:46,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:46,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:46,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:46,675 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:46,675 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:46,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:15:46,704 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:15:46,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:46,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:46,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-28 10:15:46,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:46,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:46,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:47,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:47,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-28 10:15:47,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-28 10:15:47,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-28 10:15:47,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-28 10:15:47,114 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-09-28 10:15:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:47,259 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-28 10:15:47,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-28 10:15:47,260 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-09-28 10:15:47,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:47,261 INFO L225 Difference]: With dead ends: 75 [2018-09-28 10:15:47,261 INFO L226 Difference]: Without dead ends: 74 [2018-09-28 10:15:47,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-28 10:15:47,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-28 10:15:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-09-28 10:15:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-28 10:15:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-28 10:15:47,266 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-09-28 10:15:47,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:47,267 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-28 10:15:47,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-28 10:15:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-28 10:15:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-28 10:15:47,268 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:47,268 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-09-28 10:15:47,269 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:47,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-09-28 10:15:47,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:47,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:47,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:47,603 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:47,603 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:47,611 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:15:47,650 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-28 10:15:47,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:47,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:47,675 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-09-28 10:15:47,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:47,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:47,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:48,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:48,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-28 10:15:48,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-28 10:15:48,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-28 10:15:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-28 10:15:48,013 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-09-28 10:15:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:48,119 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-28 10:15:48,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-28 10:15:48,119 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-09-28 10:15:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:48,120 INFO L225 Difference]: With dead ends: 79 [2018-09-28 10:15:48,120 INFO L226 Difference]: Without dead ends: 78 [2018-09-28 10:15:48,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-28 10:15:48,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-28 10:15:48,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-09-28 10:15:48,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-28 10:15:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-28 10:15:48,125 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-09-28 10:15:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:48,125 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-28 10:15:48,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-28 10:15:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-28 10:15:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-28 10:15:48,127 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:48,127 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-09-28 10:15:48,127 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:48,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:48,128 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-09-28 10:15:48,128 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:48,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:48,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:48,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:48,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:48,594 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:48,594 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:48,601 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:15:48,652 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-28 10:15:48,652 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:48,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:48,662 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-09-28 10:15:48,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:48,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:48,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:49,109 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:49,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-28 10:15:49,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-28 10:15:49,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-28 10:15:49,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-28 10:15:49,111 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-09-28 10:15:49,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:49,249 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-28 10:15:49,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-28 10:15:49,250 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-09-28 10:15:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:49,251 INFO L225 Difference]: With dead ends: 83 [2018-09-28 10:15:49,251 INFO L226 Difference]: Without dead ends: 82 [2018-09-28 10:15:49,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-28 10:15:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-28 10:15:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-09-28 10:15:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-28 10:15:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-28 10:15:49,257 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-09-28 10:15:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:49,257 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-28 10:15:49,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-28 10:15:49,257 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-28 10:15:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-28 10:15:49,258 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:49,258 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-09-28 10:15:49,258 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:49,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:49,259 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-09-28 10:15:49,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:49,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:49,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:49,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:49,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:49,611 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:49,611 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:49,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:49,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:49,652 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-09-28 10:15:49,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:49,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:49,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:50,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:50,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-28 10:15:50,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-28 10:15:50,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-28 10:15:50,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-28 10:15:50,285 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-09-28 10:15:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:50,453 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-28 10:15:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-28 10:15:50,454 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-28 10:15:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:50,455 INFO L225 Difference]: With dead ends: 87 [2018-09-28 10:15:50,455 INFO L226 Difference]: Without dead ends: 86 [2018-09-28 10:15:50,457 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-09-28 10:15:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-28 10:15:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-28 10:15:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-28 10:15:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-28 10:15:50,462 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-09-28 10:15:50,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:50,462 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-28 10:15:50,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-28 10:15:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-28 10:15:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-28 10:15:50,465 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:50,465 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-09-28 10:15:50,465 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:50,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:50,466 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-09-28 10:15:50,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:50,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:50,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:50,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:50,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:51,276 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:51,277 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:51,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:15:51,309 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:15:51,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:51,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:51,314 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-09-28 10:15:51,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:51,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:51,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:51,688 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:51,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-28 10:15:51,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-28 10:15:51,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-28 10:15:51,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-28 10:15:51,689 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-09-28 10:15:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:51,842 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-28 10:15:51,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-28 10:15:51,843 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-09-28 10:15:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:51,844 INFO L225 Difference]: With dead ends: 91 [2018-09-28 10:15:51,844 INFO L226 Difference]: Without dead ends: 90 [2018-09-28 10:15:51,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-28 10:15:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-28 10:15:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-09-28 10:15:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-28 10:15:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-28 10:15:51,850 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-09-28 10:15:51,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:51,850 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-28 10:15:51,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-28 10:15:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-28 10:15:51,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-28 10:15:51,851 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:51,851 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-09-28 10:15:51,851 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:51,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:51,852 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-09-28 10:15:51,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:51,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:51,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:51,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:52,511 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:52,511 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:52,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:15:52,575 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-28 10:15:52,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:52,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:52,580 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-09-28 10:15:52,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:52,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:52,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:54,616 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:54,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-28 10:15:54,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-28 10:15:54,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-28 10:15:54,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-28 10:15:54,618 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-09-28 10:15:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:54,766 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-28 10:15:54,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-28 10:15:54,767 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-09-28 10:15:54,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:54,768 INFO L225 Difference]: With dead ends: 95 [2018-09-28 10:15:54,768 INFO L226 Difference]: Without dead ends: 94 [2018-09-28 10:15:54,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-28 10:15:54,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-28 10:15:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-09-28 10:15:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-28 10:15:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-28 10:15:54,772 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-09-28 10:15:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:54,773 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-28 10:15:54,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-28 10:15:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-28 10:15:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-28 10:15:54,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:54,774 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-09-28 10:15:54,774 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:54,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:54,774 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-09-28 10:15:54,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:54,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:54,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:54,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:54,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:55,163 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:55,163 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:55,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:15:55,208 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:15:55,209 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:55,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:55,214 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-09-28 10:15:55,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:55,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:55,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:55,678 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:55,679 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-28 10:15:55,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-28 10:15:55,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-28 10:15:55,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-28 10:15:55,680 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-09-28 10:15:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:55,842 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-28 10:15:55,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-28 10:15:55,843 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-09-28 10:15:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:55,844 INFO L225 Difference]: With dead ends: 99 [2018-09-28 10:15:55,844 INFO L226 Difference]: Without dead ends: 98 [2018-09-28 10:15:55,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-28 10:15:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-28 10:15:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-09-28 10:15:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-28 10:15:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-28 10:15:55,849 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-09-28 10:15:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:55,849 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-28 10:15:55,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-28 10:15:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-28 10:15:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-28 10:15:55,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:55,850 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-09-28 10:15:55,850 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:55,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:55,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-09-28 10:15:55,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:55,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:55,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:55,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:55,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:56,254 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:56,254 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:56,262 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:15:56,357 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-28 10:15:56,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:56,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:56,383 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-09-28 10:15:56,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:56,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:56,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:57,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:57,093 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-28 10:15:57,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-28 10:15:57,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-28 10:15:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-28 10:15:57,094 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-09-28 10:15:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:57,351 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-28 10:15:57,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-28 10:15:57,352 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-28 10:15:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:57,353 INFO L225 Difference]: With dead ends: 103 [2018-09-28 10:15:57,354 INFO L226 Difference]: Without dead ends: 102 [2018-09-28 10:15:57,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-28 10:15:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-28 10:15:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-09-28 10:15:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-28 10:15:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-28 10:15:57,359 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-09-28 10:15:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:57,359 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-28 10:15:57,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-28 10:15:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-28 10:15:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-28 10:15:57,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:57,360 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-09-28 10:15:57,360 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:57,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-09-28 10:15:57,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:57,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:57,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:57,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:57,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:57,889 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:57,889 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:57,896 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:15:57,958 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-28 10:15:57,958 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:57,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:57,964 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-09-28 10:15:57,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:57,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:57,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:58,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:58,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-28 10:15:58,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-28 10:15:58,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-28 10:15:58,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-28 10:15:58,453 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-09-28 10:15:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:58,725 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-28 10:15:58,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-28 10:15:58,725 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-09-28 10:15:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:58,726 INFO L225 Difference]: With dead ends: 107 [2018-09-28 10:15:58,726 INFO L226 Difference]: Without dead ends: 106 [2018-09-28 10:15:58,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-28 10:15:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-28 10:15:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-28 10:15:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-28 10:15:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-28 10:15:58,730 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-09-28 10:15:58,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:58,731 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-28 10:15:58,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-28 10:15:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-28 10:15:58,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-28 10:15:58,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:58,732 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-09-28 10:15:58,732 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:15:58,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:58,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-09-28 10:15:58,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:58,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:58,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:58,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:58,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:59,178 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:59,178 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:15:59,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:59,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:59,225 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-09-28 10:15:59,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:59,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-09-28 10:15:59,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:59,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:59,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-28 10:15:59,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-28 10:15:59,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-28 10:15:59,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-28 10:15:59,953 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-09-28 10:16:00,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:00,154 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-28 10:16:00,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-28 10:16:00,154 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-09-28 10:16:00,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:00,155 INFO L225 Difference]: With dead ends: 111 [2018-09-28 10:16:00,155 INFO L226 Difference]: Without dead ends: 110 [2018-09-28 10:16:00,157 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-09-28 10:16:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-28 10:16:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-09-28 10:16:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-28 10:16:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-28 10:16:00,160 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-09-28 10:16:00,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:00,161 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-28 10:16:00,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-28 10:16:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-28 10:16:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-28 10:16:00,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:00,161 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-09-28 10:16:00,162 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:00,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:00,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-09-28 10:16:00,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:00,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:00,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:00,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:16:00,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:00,756 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:00,756 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:00,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:16:00,796 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:16:00,797 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:00,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:00,806 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-09-28 10:16:00,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:00,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-09-28 10:16:00,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:01,380 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:01,380 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-28 10:16:01,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-28 10:16:01,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-28 10:16:01,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-28 10:16:01,382 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-09-28 10:16:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:01,611 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-28 10:16:01,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-28 10:16:01,611 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-09-28 10:16:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:01,612 INFO L225 Difference]: With dead ends: 115 [2018-09-28 10:16:01,613 INFO L226 Difference]: Without dead ends: 114 [2018-09-28 10:16:01,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-28 10:16:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-28 10:16:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-09-28 10:16:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-28 10:16:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-28 10:16:01,617 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-09-28 10:16:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:01,618 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-28 10:16:01,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-28 10:16:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-28 10:16:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-28 10:16:01,618 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:01,618 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-09-28 10:16:01,619 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:01,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:01,619 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-09-28 10:16:01,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:01,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:01,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:01,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:01,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:02,149 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:02,149 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:02,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:16:02,236 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-28 10:16:02,236 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:02,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:02,265 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-09-28 10:16:02,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:02,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:02,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:02,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:02,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-28 10:16:02,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-28 10:16:02,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-28 10:16:02,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-28 10:16:02,876 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-09-28 10:16:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:03,074 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-28 10:16:03,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-28 10:16:03,075 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-28 10:16:03,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:03,076 INFO L225 Difference]: With dead ends: 119 [2018-09-28 10:16:03,076 INFO L226 Difference]: Without dead ends: 118 [2018-09-28 10:16:03,078 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-09-28 10:16:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-28 10:16:03,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-09-28 10:16:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-28 10:16:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-28 10:16:03,082 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-09-28 10:16:03,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:03,082 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-28 10:16:03,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-28 10:16:03,082 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-28 10:16:03,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-28 10:16:03,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:03,083 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-09-28 10:16:03,083 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:03,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-09-28 10:16:03,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:03,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:03,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:03,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:03,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:03,802 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:03,802 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:03,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:16:03,848 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:16:03,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:03,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:03,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-09-28 10:16:03,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:03,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:03,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:04,567 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:04,567 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-28 10:16:04,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-28 10:16:04,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-28 10:16:04,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-28 10:16:04,569 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-09-28 10:16:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:04,787 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-28 10:16:04,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-28 10:16:04,787 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-09-28 10:16:04,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:04,789 INFO L225 Difference]: With dead ends: 123 [2018-09-28 10:16:04,789 INFO L226 Difference]: Without dead ends: 122 [2018-09-28 10:16:04,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-28 10:16:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-28 10:16:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-09-28 10:16:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-28 10:16:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-28 10:16:04,795 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-09-28 10:16:04,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:04,795 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-28 10:16:04,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-28 10:16:04,795 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-28 10:16:04,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-28 10:16:04,796 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:04,796 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-09-28 10:16:04,796 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:04,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:04,797 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-09-28 10:16:04,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:04,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:04,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:04,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:04,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:05,537 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:05,537 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:05,546 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:16:05,623 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-28 10:16:05,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:05,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:05,650 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-09-28 10:16:05,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:05,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:05,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:06,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-09-28 10:16:06,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:06,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-28 10:16:06,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-28 10:16:06,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-28 10:16:06,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-28 10:16:06,459 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-09-28 10:16:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:06,703 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-28 10:16:06,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-28 10:16:06,704 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-09-28 10:16:06,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:06,706 INFO L225 Difference]: With dead ends: 127 [2018-09-28 10:16:06,706 INFO L226 Difference]: Without dead ends: 126 [2018-09-28 10:16:06,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-28 10:16:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-28 10:16:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-09-28 10:16:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-28 10:16:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-28 10:16:06,711 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-09-28 10:16:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:06,711 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-28 10:16:06,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-28 10:16:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-28 10:16:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-28 10:16:06,711 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:06,712 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-09-28 10:16:06,712 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:06,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-09-28 10:16:06,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:06,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:06,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:06,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:06,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:07,802 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:07,802 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:07,813 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:16:07,922 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-28 10:16:07,922 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:07,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:07,936 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-09-28 10:16:07,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:07,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:07,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:08,609 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:08,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-28 10:16:08,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-28 10:16:08,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-28 10:16:08,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-28 10:16:08,611 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-09-28 10:16:08,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:08,851 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-28 10:16:08,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-28 10:16:08,851 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-09-28 10:16:08,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:08,853 INFO L225 Difference]: With dead ends: 131 [2018-09-28 10:16:08,853 INFO L226 Difference]: Without dead ends: 130 [2018-09-28 10:16:08,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-28 10:16:08,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-28 10:16:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-09-28 10:16:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-28 10:16:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-28 10:16:08,859 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-09-28 10:16:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:08,859 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-28 10:16:08,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-28 10:16:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-28 10:16:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-28 10:16:08,860 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:08,860 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-09-28 10:16:08,860 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:08,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-09-28 10:16:08,861 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:08,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:08,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:08,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:09,563 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:09,563 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:09,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:16:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:09,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:09,642 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-09-28 10:16:09,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:09,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:09,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:10,470 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:10,471 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-28 10:16:10,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-28 10:16:10,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-28 10:16:10,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-28 10:16:10,472 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-09-28 10:16:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:10,675 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-28 10:16:10,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-28 10:16:10,676 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-09-28 10:16:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:10,677 INFO L225 Difference]: With dead ends: 135 [2018-09-28 10:16:10,677 INFO L226 Difference]: Without dead ends: 134 [2018-09-28 10:16:10,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-28 10:16:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-28 10:16:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-09-28 10:16:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-28 10:16:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-28 10:16:10,682 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-09-28 10:16:10,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:10,683 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-28 10:16:10,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-28 10:16:10,683 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-28 10:16:10,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-28 10:16:10,683 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:10,684 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-09-28 10:16:10,684 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:10,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:10,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-09-28 10:16:10,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:10,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:10,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:10,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:16:10,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:11,985 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:11,985 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:11,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:16:12,048 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:16:12,062 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:12,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:12,071 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-09-28 10:16:12,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:12,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:12,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:13,153 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:13,153 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-28 10:16:13,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-28 10:16:13,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-28 10:16:13,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-28 10:16:13,154 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-09-28 10:16:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:13,382 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-28 10:16:13,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-28 10:16:13,383 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-28 10:16:13,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:13,385 INFO L225 Difference]: With dead ends: 139 [2018-09-28 10:16:13,385 INFO L226 Difference]: Without dead ends: 138 [2018-09-28 10:16:13,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-28 10:16:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-28 10:16:13,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-09-28 10:16:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-28 10:16:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-28 10:16:13,391 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-09-28 10:16:13,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:13,392 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-28 10:16:13,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-28 10:16:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-28 10:16:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-28 10:16:13,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:13,393 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-09-28 10:16:13,393 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:13,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:13,393 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-09-28 10:16:13,393 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:13,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:13,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:13,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:13,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:14,405 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:14,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:14,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:16:14,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-28 10:16:14,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:14,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:14,550 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-09-28 10:16:14,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:14,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:14,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:16,924 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:16,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-28 10:16:16,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-28 10:16:16,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-28 10:16:16,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-28 10:16:16,926 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-09-28 10:16:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:17,270 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-28 10:16:17,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-28 10:16:17,271 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-09-28 10:16:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:17,272 INFO L225 Difference]: With dead ends: 143 [2018-09-28 10:16:17,272 INFO L226 Difference]: Without dead ends: 142 [2018-09-28 10:16:17,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-28 10:16:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-28 10:16:17,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-09-28 10:16:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-28 10:16:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-28 10:16:17,277 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-09-28 10:16:17,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:17,278 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-28 10:16:17,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-28 10:16:17,278 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-28 10:16:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-28 10:16:17,279 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:17,279 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-09-28 10:16:17,279 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:17,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:17,279 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-09-28 10:16:17,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:17,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:17,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:17,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:17,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:18,046 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:18,047 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:18,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:16:18,099 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:16:18,099 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:18,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:18,122 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-09-28 10:16:18,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:18,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:18,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:19,519 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:19,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-28 10:16:19,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-28 10:16:19,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-28 10:16:19,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-28 10:16:19,521 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-09-28 10:16:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:19,945 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-28 10:16:19,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-28 10:16:19,946 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-09-28 10:16:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:19,947 INFO L225 Difference]: With dead ends: 147 [2018-09-28 10:16:19,947 INFO L226 Difference]: Without dead ends: 146 [2018-09-28 10:16:19,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-28 10:16:19,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-28 10:16:19,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-09-28 10:16:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-28 10:16:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-28 10:16:19,954 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-09-28 10:16:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:19,954 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-28 10:16:19,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-28 10:16:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-28 10:16:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-28 10:16:19,955 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:19,955 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-09-28 10:16:19,955 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:19,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-09-28 10:16:19,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:19,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:20,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:20,791 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:20,791 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:20,800 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:16:20,884 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-28 10:16:20,884 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:20,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:20,891 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-09-28 10:16:20,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:20,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:20,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:21,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:21,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-28 10:16:21,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-28 10:16:21,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-28 10:16:21,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-28 10:16:21,943 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-09-28 10:16:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:22,325 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-28 10:16:22,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-28 10:16:22,325 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-09-28 10:16:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:22,330 INFO L225 Difference]: With dead ends: 151 [2018-09-28 10:16:22,330 INFO L226 Difference]: Without dead ends: 150 [2018-09-28 10:16:22,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-28 10:16:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-28 10:16:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-09-28 10:16:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-28 10:16:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-28 10:16:22,335 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-09-28 10:16:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:22,335 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-28 10:16:22,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-28 10:16:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-28 10:16:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-28 10:16:22,336 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:22,336 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-09-28 10:16:22,337 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:22,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-09-28 10:16:22,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:22,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:22,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:23,163 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:23,163 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:23,172 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:16:23,286 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-28 10:16:23,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:23,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:23,304 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-09-28 10:16:23,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:23,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:23,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:24,341 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:24,342 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-28 10:16:24,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-28 10:16:24,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-28 10:16:24,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-28 10:16:24,343 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-09-28 10:16:24,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:24,673 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-28 10:16:24,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-28 10:16:24,673 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-09-28 10:16:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:24,675 INFO L225 Difference]: With dead ends: 155 [2018-09-28 10:16:24,675 INFO L226 Difference]: Without dead ends: 154 [2018-09-28 10:16:24,676 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-09-28 10:16:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-28 10:16:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-09-28 10:16:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-28 10:16:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-28 10:16:24,681 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-09-28 10:16:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:24,682 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-28 10:16:24,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-28 10:16:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-28 10:16:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-28 10:16:24,683 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:24,683 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-09-28 10:16:24,683 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:24,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:24,683 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-09-28 10:16:24,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:24,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:24,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:24,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:24,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:25,575 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:25,575 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:25,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:16:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:25,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:25,657 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-09-28 10:16:25,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:25,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:25,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:26,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:26,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-28 10:16:26,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-28 10:16:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-28 10:16:26,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-28 10:16:26,890 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-09-28 10:16:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:27,158 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-28 10:16:27,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-28 10:16:27,158 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-09-28 10:16:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:27,160 INFO L225 Difference]: With dead ends: 159 [2018-09-28 10:16:27,160 INFO L226 Difference]: Without dead ends: 158 [2018-09-28 10:16:27,161 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-09-28 10:16:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-28 10:16:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-28 10:16:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-28 10:16:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-28 10:16:27,166 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-09-28 10:16:27,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:27,166 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-28 10:16:27,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-28 10:16:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-28 10:16:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-28 10:16:27,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:27,167 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-09-28 10:16:27,167 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:27,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-09-28 10:16:27,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:27,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:27,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:16:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:28,309 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:28,309 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:28,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:16:28,360 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:16:28,360 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:28,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:28,367 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-09-28 10:16:28,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:28,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:28,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:29,695 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:29,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-28 10:16:29,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-28 10:16:29,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-28 10:16:29,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-28 10:16:29,696 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-09-28 10:16:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:30,021 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-28 10:16:30,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-28 10:16:30,021 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-09-28 10:16:30,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:30,022 INFO L225 Difference]: With dead ends: 163 [2018-09-28 10:16:30,022 INFO L226 Difference]: Without dead ends: 162 [2018-09-28 10:16:30,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-28 10:16:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-28 10:16:30,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-28 10:16:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-28 10:16:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-28 10:16:30,029 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-09-28 10:16:30,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:30,030 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-28 10:16:30,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-28 10:16:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-28 10:16:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-28 10:16:30,031 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:30,031 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-09-28 10:16:30,031 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:30,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:30,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-09-28 10:16:30,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:30,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:30,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:30,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:30,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:31,378 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:31,378 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:31,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:16:31,547 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-28 10:16:31,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:31,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:31,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-09-28 10:16:31,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:31,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:31,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:32,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:32,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-28 10:16:32,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-28 10:16:32,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-28 10:16:32,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-28 10:16:32,641 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-09-28 10:16:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:33,093 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-28 10:16:33,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-28 10:16:33,094 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-09-28 10:16:33,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:33,095 INFO L225 Difference]: With dead ends: 167 [2018-09-28 10:16:33,095 INFO L226 Difference]: Without dead ends: 166 [2018-09-28 10:16:33,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-28 10:16:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-28 10:16:33,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-28 10:16:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-28 10:16:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-28 10:16:33,103 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-09-28 10:16:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:33,103 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-28 10:16:33,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-28 10:16:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-28 10:16:33,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-28 10:16:33,104 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:33,104 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-09-28 10:16:33,104 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:33,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:33,105 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-09-28 10:16:33,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:33,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:33,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:33,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:33,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:34,144 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:34,144 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:34,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:16:34,202 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:16:34,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:34,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:34,225 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-09-28 10:16:34,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:34,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:34,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:35,634 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:35,634 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-28 10:16:35,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-28 10:16:35,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-28 10:16:35,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-28 10:16:35,636 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-09-28 10:16:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:35,898 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-28 10:16:35,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-28 10:16:35,898 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-09-28 10:16:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:35,900 INFO L225 Difference]: With dead ends: 171 [2018-09-28 10:16:35,900 INFO L226 Difference]: Without dead ends: 170 [2018-09-28 10:16:35,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-28 10:16:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-28 10:16:35,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-28 10:16:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-28 10:16:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-28 10:16:35,906 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-09-28 10:16:35,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:35,906 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-28 10:16:35,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-28 10:16:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-28 10:16:35,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-28 10:16:35,907 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:35,908 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-09-28 10:16:35,908 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:35,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:35,908 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-09-28 10:16:35,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:35,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:35,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:35,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:35,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:37,531 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:37,532 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:37,546 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:16:37,701 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-28 10:16:37,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:37,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:37,725 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-09-28 10:16:37,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:37,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-09-28 10:16:37,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:39,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:39,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-28 10:16:39,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-28 10:16:39,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-28 10:16:39,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-28 10:16:39,032 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-09-28 10:16:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:39,367 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-28 10:16:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-28 10:16:39,367 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-09-28 10:16:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:39,369 INFO L225 Difference]: With dead ends: 175 [2018-09-28 10:16:39,369 INFO L226 Difference]: Without dead ends: 174 [2018-09-28 10:16:39,370 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-09-28 10:16:39,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-28 10:16:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-28 10:16:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-28 10:16:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-28 10:16:39,374 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-09-28 10:16:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:39,374 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-28 10:16:39,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-28 10:16:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-28 10:16:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-28 10:16:39,375 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:39,375 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-09-28 10:16:39,376 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:39,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:39,376 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-09-28 10:16:39,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:39,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:39,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:39,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:39,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:40,506 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:40,506 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:40,521 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:16:40,721 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-28 10:16:40,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:40,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:40,729 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-09-28 10:16:40,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:40,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:40,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:41,971 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:41,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-28 10:16:41,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-28 10:16:41,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-28 10:16:41,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-28 10:16:41,973 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-09-28 10:16:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:42,593 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-28 10:16:42,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-28 10:16:42,593 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-09-28 10:16:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:42,595 INFO L225 Difference]: With dead ends: 179 [2018-09-28 10:16:42,595 INFO L226 Difference]: Without dead ends: 178 [2018-09-28 10:16:42,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-28 10:16:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-28 10:16:42,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-28 10:16:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-28 10:16:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-28 10:16:42,601 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-09-28 10:16:42,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:42,601 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-28 10:16:42,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-28 10:16:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-28 10:16:42,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-28 10:16:42,602 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:42,602 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-09-28 10:16:42,602 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:42,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:42,603 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-09-28 10:16:42,603 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:42,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:42,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:42,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:42,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:43,659 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:43,660 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:16:43,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:16:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:43,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:43,726 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-09-28 10:16:43,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:43,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:43,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:45,259 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:45,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-28 10:16:45,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-28 10:16:45,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-28 10:16:45,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-28 10:16:45,261 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-09-28 10:16:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:45,545 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-28 10:16:45,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-28 10:16:45,545 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-09-28 10:16:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:45,547 INFO L225 Difference]: With dead ends: 183 [2018-09-28 10:16:45,547 INFO L226 Difference]: Without dead ends: 182 [2018-09-28 10:16:45,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-28 10:16:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-28 10:16:45,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-09-28 10:16:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-28 10:16:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-28 10:16:45,552 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-09-28 10:16:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:45,552 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-28 10:16:45,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-28 10:16:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-28 10:16:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-28 10:16:45,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:45,553 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-09-28 10:16:45,553 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:45,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:45,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-09-28 10:16:45,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:45,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:45,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:45,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:16:45,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:46,792 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:46,792 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-09-28 10:16:46,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:16:46,855 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:16:46,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:46,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:46,865 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-09-28 10:16:46,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:46,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:46,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:48,276 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:48,276 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-28 10:16:48,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-28 10:16:48,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-28 10:16:48,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-28 10:16:48,278 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-09-28 10:16:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:48,570 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-28 10:16:48,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-28 10:16:48,571 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-09-28 10:16:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:48,572 INFO L225 Difference]: With dead ends: 187 [2018-09-28 10:16:48,572 INFO L226 Difference]: Without dead ends: 186 [2018-09-28 10:16:48,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-28 10:16:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-28 10:16:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-09-28 10:16:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-28 10:16:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-28 10:16:48,579 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-09-28 10:16:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:48,579 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-28 10:16:48,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-28 10:16:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-28 10:16:48,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-28 10:16:48,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:48,580 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-09-28 10:16:48,581 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:48,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:48,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-09-28 10:16:48,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:48,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:48,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:49,854 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:49,854 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-09-28 10:16:49,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:16:50,037 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-28 10:16:50,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:50,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:50,046 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-09-28 10:16:50,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:50,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:50,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:51,446 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:51,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-28 10:16:51,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-28 10:16:51,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-28 10:16:51,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-28 10:16:51,448 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-09-28 10:16:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:51,754 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-28 10:16:51,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-28 10:16:51,754 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-09-28 10:16:51,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:51,756 INFO L225 Difference]: With dead ends: 191 [2018-09-28 10:16:51,756 INFO L226 Difference]: Without dead ends: 190 [2018-09-28 10:16:51,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-28 10:16:51,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-28 10:16:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-09-28 10:16:51,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-28 10:16:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-28 10:16:51,761 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-09-28 10:16:51,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:51,761 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-28 10:16:51,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-28 10:16:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-28 10:16:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-28 10:16:51,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:51,762 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-09-28 10:16:51,762 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:51,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:51,762 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-09-28 10:16:51,762 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:51,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:51,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:51,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:51,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:53,311 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:53,311 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-28 10:16:53,318 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:16:53,378 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:16:53,378 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:53,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:53,386 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-09-28 10:16:53,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:53,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:53,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:56,089 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:56,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-28 10:16:56,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-28 10:16:56,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-28 10:16:56,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-28 10:16:56,091 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-09-28 10:16:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:56,570 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-28 10:16:56,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-28 10:16:56,570 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-09-28 10:16:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:56,573 INFO L225 Difference]: With dead ends: 195 [2018-09-28 10:16:56,573 INFO L226 Difference]: Without dead ends: 194 [2018-09-28 10:16:56,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-28 10:16:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-28 10:16:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-09-28 10:16:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-28 10:16:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-28 10:16:56,579 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-09-28 10:16:56,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:56,580 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-28 10:16:56,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-28 10:16:56,580 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-28 10:16:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-28 10:16:56,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:56,581 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-09-28 10:16:56,581 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:16:56,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:56,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-09-28 10:16:56,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:56,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:56,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:56,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:56,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:58,763 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:58,763 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-09-28 10:16:58,770 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:16:58,907 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-28 10:16:58,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:58,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:58,953 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-09-28 10:16:58,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:58,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:58,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:00,655 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:00,656 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-28 10:17:00,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-28 10:17:00,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-28 10:17:00,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-28 10:17:00,657 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-09-28 10:17:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:01,074 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-28 10:17:01,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-28 10:17:01,075 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-09-28 10:17:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:01,076 INFO L225 Difference]: With dead ends: 199 [2018-09-28 10:17:01,077 INFO L226 Difference]: Without dead ends: 198 [2018-09-28 10:17:01,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-28 10:17:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-28 10:17:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-09-28 10:17:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-28 10:17:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-28 10:17:01,083 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-09-28 10:17:01,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:01,083 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-28 10:17:01,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-28 10:17:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-28 10:17:01,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-28 10:17:01,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:01,084 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-09-28 10:17:01,084 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:01,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:01,085 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-09-28 10:17:01,085 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:01,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:01,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:01,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:01,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:02,541 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:02,541 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-09-28 10:17:02,549 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:17:02,713 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-28 10:17:02,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:02,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:02,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-09-28 10:17:02,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:02,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:02,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:04,230 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:04,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-28 10:17:04,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-28 10:17:04,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-28 10:17:04,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-28 10:17:04,232 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-09-28 10:17:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:04,597 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-28 10:17:04,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-28 10:17:04,597 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-09-28 10:17:04,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:04,599 INFO L225 Difference]: With dead ends: 203 [2018-09-28 10:17:04,599 INFO L226 Difference]: Without dead ends: 202 [2018-09-28 10:17:04,600 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-09-28 10:17:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-28 10:17:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-09-28 10:17:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-28 10:17:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-28 10:17:04,606 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-09-28 10:17:04,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:04,606 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-28 10:17:04,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-28 10:17:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-28 10:17:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-28 10:17:04,607 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:04,607 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-09-28 10:17:04,608 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:04,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:04,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-09-28 10:17:04,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:04,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:04,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:04,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:04,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:06,281 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:06,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 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-09-28 10:17:06,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:17:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:06,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:06,359 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-09-28 10:17:06,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:06,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:06,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:07,952 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:07,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-28 10:17:07,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-28 10:17:07,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-28 10:17:07,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-28 10:17:07,954 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-09-28 10:17:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:08,281 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-28 10:17:08,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-28 10:17:08,281 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-09-28 10:17:08,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:08,283 INFO L225 Difference]: With dead ends: 207 [2018-09-28 10:17:08,283 INFO L226 Difference]: Without dead ends: 206 [2018-09-28 10:17:08,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-28 10:17:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-28 10:17:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-09-28 10:17:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-28 10:17:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-28 10:17:08,290 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-09-28 10:17:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:08,290 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-28 10:17:08,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-28 10:17:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-28 10:17:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-28 10:17:08,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:08,291 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-09-28 10:17:08,292 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:08,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:08,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-09-28 10:17:08,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:08,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:08,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:08,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:17:08,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:09,722 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:09,722 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-09-28 10:17:09,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:17:09,790 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:17:09,790 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:09,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:09,803 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-09-28 10:17:09,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:09,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:09,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:11,974 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:11,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-28 10:17:11,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-28 10:17:11,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-28 10:17:11,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-28 10:17:11,976 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-09-28 10:17:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:12,314 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-28 10:17:12,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-28 10:17:12,314 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-09-28 10:17:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:12,316 INFO L225 Difference]: With dead ends: 211 [2018-09-28 10:17:12,316 INFO L226 Difference]: Without dead ends: 210 [2018-09-28 10:17:12,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-28 10:17:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-28 10:17:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-09-28 10:17:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-28 10:17:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-28 10:17:12,322 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-09-28 10:17:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:12,322 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-28 10:17:12,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-28 10:17:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-28 10:17:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-28 10:17:12,324 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:12,324 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-09-28 10:17:12,324 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:12,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:12,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-09-28 10:17:12,324 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:12,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:12,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:12,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:12,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:13,720 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:13,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 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-09-28 10:17:13,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:17:14,108 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-28 10:17:14,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:14,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:14,135 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-09-28 10:17:14,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:14,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:14,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:15,952 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:15,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-28 10:17:15,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-28 10:17:15,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-28 10:17:15,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-28 10:17:15,955 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-09-28 10:17:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:16,314 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-28 10:17:16,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-28 10:17:16,315 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-09-28 10:17:16,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:16,316 INFO L225 Difference]: With dead ends: 215 [2018-09-28 10:17:16,317 INFO L226 Difference]: Without dead ends: 214 [2018-09-28 10:17:16,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-28 10:17:16,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-28 10:17:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-09-28 10:17:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-28 10:17:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-28 10:17:16,323 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-09-28 10:17:16,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:16,323 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-28 10:17:16,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-28 10:17:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-28 10:17:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-28 10:17:16,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:16,325 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-09-28 10:17:16,325 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:16,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:16,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-09-28 10:17:16,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:16,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:16,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:16,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:16,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:17,760 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:17,760 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-28 10:17:17,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:17:17,827 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:17:17,828 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:17,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:17,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-09-28 10:17:17,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:17,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:17,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:19,608 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:19,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-28 10:17:19,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-28 10:17:19,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-28 10:17:19,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-28 10:17:19,610 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-09-28 10:17:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:19,959 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-28 10:17:19,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-28 10:17:19,959 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-09-28 10:17:19,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:19,961 INFO L225 Difference]: With dead ends: 219 [2018-09-28 10:17:19,961 INFO L226 Difference]: Without dead ends: 218 [2018-09-28 10:17:19,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-28 10:17:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-28 10:17:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-09-28 10:17:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-28 10:17:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-28 10:17:19,966 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-09-28 10:17:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:19,966 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-28 10:17:19,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-28 10:17:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-28 10:17:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-28 10:17:19,967 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:19,968 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-09-28 10:17:19,968 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:19,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:19,968 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-09-28 10:17:19,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:19,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:19,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:19,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:19,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:21,812 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:21,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 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-09-28 10:17:21,820 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:17:21,976 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-28 10:17:21,976 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:21,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:21,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-28 10:17:21,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:21,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:21,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:23,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:23,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-28 10:17:23,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-28 10:17:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-28 10:17:23,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-28 10:17:23,768 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-09-28 10:17:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:24,135 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-28 10:17:24,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-28 10:17:24,135 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-09-28 10:17:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:24,137 INFO L225 Difference]: With dead ends: 223 [2018-09-28 10:17:24,137 INFO L226 Difference]: Without dead ends: 222 [2018-09-28 10:17:24,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-28 10:17:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-28 10:17:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-09-28 10:17:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-28 10:17:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-28 10:17:24,141 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-09-28 10:17:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:24,141 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-28 10:17:24,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-28 10:17:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-28 10:17:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-28 10:17:24,142 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:24,142 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-09-28 10:17:24,143 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:24,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:24,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-09-28 10:17:24,143 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:24,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:24,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:24,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:24,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:25,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:25,976 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:25,976 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-28 10:17:25,983 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:17:26,202 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-28 10:17:26,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:26,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:26,211 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-09-28 10:17:26,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:26,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:26,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:28,101 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:28,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-28 10:17:28,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-28 10:17:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-28 10:17:28,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-28 10:17:28,103 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-09-28 10:17:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:28,433 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-28 10:17:28,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-28 10:17:28,433 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-09-28 10:17:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:28,435 INFO L225 Difference]: With dead ends: 227 [2018-09-28 10:17:28,435 INFO L226 Difference]: Without dead ends: 226 [2018-09-28 10:17:28,435 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-09-28 10:17:28,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-28 10:17:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-09-28 10:17:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-28 10:17:28,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-28 10:17:28,442 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-09-28 10:17:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:28,442 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-28 10:17:28,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-28 10:17:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-28 10:17:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-28 10:17:28,443 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:28,443 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-09-28 10:17:28,444 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:28,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:28,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-09-28 10:17:28,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:28,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:28,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:28,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:28,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:30,029 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:30,029 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-09-28 10:17:30,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:17:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:30,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:30,105 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-09-28 10:17:30,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:30,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:30,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:32,262 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:32,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-28 10:17:32,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-28 10:17:32,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-28 10:17:32,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-28 10:17:32,263 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-09-28 10:17:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:32,662 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-28 10:17:32,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-28 10:17:32,662 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-09-28 10:17:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:32,664 INFO L225 Difference]: With dead ends: 231 [2018-09-28 10:17:32,664 INFO L226 Difference]: Without dead ends: 230 [2018-09-28 10:17:32,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-28 10:17:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-28 10:17:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-09-28 10:17:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-28 10:17:32,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-28 10:17:32,670 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-09-28 10:17:32,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:32,671 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-28 10:17:32,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-28 10:17:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-28 10:17:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-28 10:17:32,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:32,672 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-09-28 10:17:32,672 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:32,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:32,673 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-09-28 10:17:32,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:32,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:32,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:32,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:17:32,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:34,416 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:34,416 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-09-28 10:17:34,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:17:34,498 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:17:34,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:34,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:34,508 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-09-28 10:17:34,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:34,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:34,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:37,315 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:37,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-28 10:17:37,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-28 10:17:37,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-28 10:17:37,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-28 10:17:37,318 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-09-28 10:17:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:37,750 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-28 10:17:37,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-28 10:17:37,751 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-09-28 10:17:37,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:37,752 INFO L225 Difference]: With dead ends: 235 [2018-09-28 10:17:37,753 INFO L226 Difference]: Without dead ends: 234 [2018-09-28 10:17:37,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-28 10:17:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-28 10:17:37,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-09-28 10:17:37,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-28 10:17:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-28 10:17:37,758 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-09-28 10:17:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:37,759 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-28 10:17:37,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-28 10:17:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-28 10:17:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-28 10:17:37,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:37,760 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-09-28 10:17:37,760 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:37,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:37,761 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-09-28 10:17:37,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:37,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:37,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:37,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:37,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:39,477 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:39,477 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-09-28 10:17:39,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:17:39,750 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-28 10:17:39,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:39,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:39,773 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-09-28 10:17:39,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:39,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:39,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:42,250 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:42,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-28 10:17:42,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-28 10:17:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-28 10:17:42,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-28 10:17:42,252 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-09-28 10:17:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:42,671 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-28 10:17:42,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-28 10:17:42,671 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-09-28 10:17:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:42,673 INFO L225 Difference]: With dead ends: 239 [2018-09-28 10:17:42,673 INFO L226 Difference]: Without dead ends: 238 [2018-09-28 10:17:42,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-28 10:17:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-28 10:17:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-09-28 10:17:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-28 10:17:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-28 10:17:42,677 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-09-28 10:17:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:42,678 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-28 10:17:42,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-28 10:17:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-28 10:17:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-28 10:17:42,679 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:42,679 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-09-28 10:17:42,679 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:42,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:42,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-09-28 10:17:42,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:42,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:42,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:42,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:42,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:44,416 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:44,416 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-09-28 10:17:44,424 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:17:44,499 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:17:44,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:44,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:44,509 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-09-28 10:17:44,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:44,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:44,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:46,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:46,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-28 10:17:46,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-28 10:17:46,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-28 10:17:46,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-28 10:17:46,897 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-09-28 10:17:47,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:47,344 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-28 10:17:47,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-28 10:17:47,345 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-09-28 10:17:47,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:47,346 INFO L225 Difference]: With dead ends: 243 [2018-09-28 10:17:47,346 INFO L226 Difference]: Without dead ends: 242 [2018-09-28 10:17:47,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-28 10:17:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-28 10:17:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-09-28 10:17:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-28 10:17:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-28 10:17:47,351 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-09-28 10:17:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:47,351 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-28 10:17:47,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-28 10:17:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-28 10:17:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-28 10:17:47,352 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:47,352 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-09-28 10:17:47,353 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:47,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:47,353 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-09-28 10:17:47,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:47,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:47,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:47,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:47,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:49,161 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:49,162 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-09-28 10:17:49,168 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:17:49,344 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-28 10:17:49,344 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:49,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:49,358 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-09-28 10:17:49,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:49,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:49,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:51,763 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:51,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-28 10:17:51,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-28 10:17:51,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-28 10:17:51,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-28 10:17:51,765 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-09-28 10:17:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:52,153 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-09-28 10:17:52,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-28 10:17:52,153 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-09-28 10:17:52,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:52,155 INFO L225 Difference]: With dead ends: 247 [2018-09-28 10:17:52,155 INFO L226 Difference]: Without dead ends: 246 [2018-09-28 10:17:52,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-28 10:17:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-28 10:17:52,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-09-28 10:17:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-28 10:17:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-28 10:17:52,162 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-09-28 10:17:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:52,163 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-28 10:17:52,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-28 10:17:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-28 10:17:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-28 10:17:52,164 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:52,164 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-09-28 10:17:52,164 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:52,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:52,165 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-09-28 10:17:52,165 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:52,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:52,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:52,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:52,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:53,994 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:53,994 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-09-28 10:17:54,001 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:17:54,246 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-09-28 10:17:54,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:54,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:54,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-09-28 10:17:54,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:54,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:54,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:56,689 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:56,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-28 10:17:56,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-28 10:17:56,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-28 10:17:56,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-28 10:17:56,691 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-09-28 10:17:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:57,192 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-28 10:17:57,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-28 10:17:57,192 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-09-28 10:17:57,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:57,194 INFO L225 Difference]: With dead ends: 251 [2018-09-28 10:17:57,194 INFO L226 Difference]: Without dead ends: 250 [2018-09-28 10:17:57,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-28 10:17:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-28 10:17:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-09-28 10:17:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-28 10:17:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-09-28 10:17:57,201 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-09-28 10:17:57,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:57,202 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-09-28 10:17:57,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-28 10:17:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-09-28 10:17:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-28 10:17:57,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:57,203 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-09-28 10:17:57,203 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:17:57,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:57,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-09-28 10:17:57,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:57,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:57,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:57,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:57,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:59,101 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:59,101 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-09-28 10:17:59,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:17:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:59,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:59,188 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-09-28 10:17:59,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:59,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-09-28 10:17:59,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:01,507 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:01,507 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-09-28 10:18:01,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-28 10:18:01,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-28 10:18:01,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-28 10:18:01,509 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-09-28 10:18:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:01,979 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-28 10:18:01,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-28 10:18:01,979 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-09-28 10:18:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:01,981 INFO L225 Difference]: With dead ends: 255 [2018-09-28 10:18:01,981 INFO L226 Difference]: Without dead ends: 254 [2018-09-28 10:18:01,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-28 10:18:01,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-28 10:18:01,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-09-28 10:18:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-28 10:18:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-09-28 10:18:01,987 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-09-28 10:18:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:01,987 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-09-28 10:18:01,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-28 10:18:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-09-28 10:18:01,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-28 10:18:01,988 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:01,988 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-09-28 10:18:01,988 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:18:01,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:01,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-09-28 10:18:01,989 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:01,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:01,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:01,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:18:01,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:03,931 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:03,931 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-09-28 10:18:03,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:18:04,009 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:18:04,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:04,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:04,017 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-09-28 10:18:04,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:04,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:04,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:06,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:06,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-09-28 10:18:06,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-28 10:18:06,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-28 10:18:06,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-28 10:18:06,437 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-09-28 10:18:06,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:06,977 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-09-28 10:18:06,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-28 10:18:06,978 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-09-28 10:18:06,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:06,979 INFO L225 Difference]: With dead ends: 259 [2018-09-28 10:18:06,980 INFO L226 Difference]: Without dead ends: 258 [2018-09-28 10:18:06,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-28 10:18:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-28 10:18:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-09-28 10:18:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-28 10:18:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-28 10:18:06,985 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-09-28 10:18:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:06,985 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-28 10:18:06,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-28 10:18:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-28 10:18:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-28 10:18:06,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:06,986 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-09-28 10:18:06,987 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:18:06,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:06,987 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-09-28 10:18:06,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:06,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:06,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:06,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:06,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:09,037 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:09,037 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-09-28 10:18:09,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:18:09,358 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-09-28 10:18:09,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:09,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:09,372 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-09-28 10:18:09,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:09,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:09,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:11,995 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:11,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-09-28 10:18:11,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-28 10:18:11,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-28 10:18:11,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-28 10:18:11,997 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-09-28 10:18:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:12,470 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-09-28 10:18:12,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-28 10:18:12,471 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-09-28 10:18:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:12,472 INFO L225 Difference]: With dead ends: 263 [2018-09-28 10:18:12,473 INFO L226 Difference]: Without dead ends: 262 [2018-09-28 10:18:12,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-28 10:18:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-28 10:18:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-09-28 10:18:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-28 10:18:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-28 10:18:12,480 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-09-28 10:18:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:12,480 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-28 10:18:12,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-28 10:18:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-28 10:18:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-28 10:18:12,482 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:12,482 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-09-28 10:18:12,482 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:18:12,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:12,483 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-09-28 10:18:12,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:12,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:12,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:12,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:12,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:14,660 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:14,660 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-09-28 10:18:14,668 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:18:14,749 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:18:14,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:14,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:14,763 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-09-28 10:18:14,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:14,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:14,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:17,767 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:17,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-09-28 10:18:17,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-28 10:18:17,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-28 10:18:17,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-28 10:18:17,770 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-09-28 10:18:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:18,272 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-09-28 10:18:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-28 10:18:18,273 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-09-28 10:18:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:18,274 INFO L225 Difference]: With dead ends: 267 [2018-09-28 10:18:18,274 INFO L226 Difference]: Without dead ends: 266 [2018-09-28 10:18:18,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-28 10:18:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-28 10:18:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-09-28 10:18:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-28 10:18:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-09-28 10:18:18,281 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-09-28 10:18:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:18,281 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-09-28 10:18:18,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-28 10:18:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-09-28 10:18:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-28 10:18:18,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:18,283 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-09-28 10:18:18,283 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:18:18,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:18,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-09-28 10:18:18,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:18,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:18,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:18,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:18,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:20,467 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:20,467 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-09-28 10:18:20,474 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:18:20,681 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-09-28 10:18:20,681 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:20,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:20,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-28 10:18:20,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:20,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:20,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:23,467 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:23,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-09-28 10:18:23,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-28 10:18:23,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-28 10:18:23,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-28 10:18:23,469 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-09-28 10:18:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:23,968 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-28 10:18:23,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-28 10:18:23,969 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-09-28 10:18:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:23,971 INFO L225 Difference]: With dead ends: 271 [2018-09-28 10:18:23,971 INFO L226 Difference]: Without dead ends: 270 [2018-09-28 10:18:23,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-28 10:18:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-28 10:18:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-09-28 10:18:23,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-28 10:18:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-28 10:18:23,978 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-09-28 10:18:23,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:23,978 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-28 10:18:23,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-28 10:18:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-28 10:18:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-28 10:18:23,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:23,980 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-09-28 10:18:23,980 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:18:23,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:23,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-09-28 10:18:23,981 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:23,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:23,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:23,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:23,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:26,223 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:26,223 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-09-28 10:18:26,230 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:18:26,540 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-09-28 10:18:26,540 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:26,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:26,554 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-09-28 10:18:26,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:26,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:26,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:29,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:29,453 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:29,453 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-09-28 10:18:29,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-28 10:18:29,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-28 10:18:29,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-28 10:18:29,456 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-09-28 10:18:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:30,022 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-28 10:18:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-28 10:18:30,023 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-09-28 10:18:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:30,024 INFO L225 Difference]: With dead ends: 275 [2018-09-28 10:18:30,024 INFO L226 Difference]: Without dead ends: 274 [2018-09-28 10:18:30,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-28 10:18:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-28 10:18:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-09-28 10:18:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-28 10:18:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-09-28 10:18:30,030 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-09-28 10:18:30,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:30,030 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-09-28 10:18:30,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-28 10:18:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-09-28 10:18:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-28 10:18:30,031 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:30,031 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-09-28 10:18:30,031 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:18:30,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:30,032 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-09-28 10:18:30,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:30,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:30,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:30,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:30,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:32,672 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:32,672 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-09-28 10:18:32,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:18:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:32,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:32,768 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-09-28 10:18:32,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:32,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:32,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:35,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:35,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-09-28 10:18:35,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-28 10:18:35,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-28 10:18:35,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-28 10:18:35,475 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-09-28 10:18:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:35,919 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-09-28 10:18:35,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-28 10:18:35,920 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-09-28 10:18:35,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:35,922 INFO L225 Difference]: With dead ends: 279 [2018-09-28 10:18:35,922 INFO L226 Difference]: Without dead ends: 278 [2018-09-28 10:18:35,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-28 10:18:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-28 10:18:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-09-28 10:18:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-28 10:18:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-28 10:18:35,928 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-09-28 10:18:35,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:35,928 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-28 10:18:35,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-28 10:18:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-28 10:18:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-28 10:18:35,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:35,930 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-09-28 10:18:35,930 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:18:35,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:35,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-09-28 10:18:35,931 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:35,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:35,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:18:35,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:38,522 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:38,522 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-09-28 10:18:38,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:18:38,606 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:18:38,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:38,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:38,618 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-09-28 10:18:38,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:38,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:38,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:41,424 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:41,424 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-09-28 10:18:41,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-28 10:18:41,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-28 10:18:41,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-28 10:18:41,426 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-09-28 10:18:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:41,949 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-09-28 10:18:41,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-28 10:18:41,950 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-09-28 10:18:41,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:41,952 INFO L225 Difference]: With dead ends: 283 [2018-09-28 10:18:41,952 INFO L226 Difference]: Without dead ends: 282 [2018-09-28 10:18:41,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-28 10:18:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-28 10:18:41,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-09-28 10:18:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-28 10:18:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-28 10:18:41,959 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-09-28 10:18:41,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:41,959 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-28 10:18:41,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-28 10:18:41,959 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-28 10:18:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-28 10:18:41,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:41,961 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-09-28 10:18:41,961 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:18:41,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-09-28 10:18:41,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:41,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:41,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:44,617 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:44,617 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-09-28 10:18:44,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:18:45,005 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-09-28 10:18:45,005 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:45,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:45,014 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-09-28 10:18:45,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:45,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:45,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:48,163 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:48,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-09-28 10:18:48,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-28 10:18:48,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-28 10:18:48,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-28 10:18:48,165 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-09-28 10:18:48,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:48,636 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-09-28 10:18:48,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-28 10:18:48,637 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-09-28 10:18:48,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:48,639 INFO L225 Difference]: With dead ends: 287 [2018-09-28 10:18:48,639 INFO L226 Difference]: Without dead ends: 286 [2018-09-28 10:18:48,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-28 10:18:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-28 10:18:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-09-28 10:18:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-28 10:18:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-09-28 10:18:48,644 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-09-28 10:18:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:48,644 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-09-28 10:18:48,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-28 10:18:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-09-28 10:18:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-28 10:18:48,645 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:48,646 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-09-28 10:18:48,646 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:18:48,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:48,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-09-28 10:18:48,646 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:48,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:48,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:48,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:48,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:51,139 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:51,139 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-09-28 10:18:51,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:18:51,231 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:18:51,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:51,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:51,244 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-09-28 10:18:51,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:51,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:51,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:54,530 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:54,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-09-28 10:18:54,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-28 10:18:54,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-28 10:18:54,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-28 10:18:54,532 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-09-28 10:18:55,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:55,139 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-28 10:18:55,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-28 10:18:55,140 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-09-28 10:18:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:55,142 INFO L225 Difference]: With dead ends: 291 [2018-09-28 10:18:55,142 INFO L226 Difference]: Without dead ends: 290 [2018-09-28 10:18:55,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-28 10:18:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-28 10:18:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-09-28 10:18:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-28 10:18:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-09-28 10:18:55,148 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-09-28 10:18:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:55,148 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-09-28 10:18:55,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-28 10:18:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-09-28 10:18:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-28 10:18:55,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:55,149 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-09-28 10:18:55,149 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:18:55,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-09-28 10:18:55,150 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:55,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:55,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:55,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:55,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:57,681 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:57,681 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-09-28 10:18:57,687 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:18:57,956 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-09-28 10:18:57,956 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:57,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:57,968 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-09-28 10:18:57,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:57,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:57,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:19:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:01,046 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:19:01,047 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-09-28 10:19:01,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-28 10:19:01,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-28 10:19:01,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-28 10:19:01,049 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-09-28 10:19:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:19:01,588 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-28 10:19:01,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-28 10:19:01,589 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-09-28 10:19:01,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:19:01,591 INFO L225 Difference]: With dead ends: 295 [2018-09-28 10:19:01,591 INFO L226 Difference]: Without dead ends: 294 [2018-09-28 10:19:01,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-28 10:19:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-28 10:19:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-09-28 10:19:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-28 10:19:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-09-28 10:19:01,596 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-09-28 10:19:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:19:01,596 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-09-28 10:19:01,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-28 10:19:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-09-28 10:19:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-28 10:19:01,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:19:01,598 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-09-28 10:19:01,598 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:19:01,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:19:01,599 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-09-28 10:19:01,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:19:01,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:19:01,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:01,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:19:01,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:19:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:04,475 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:19:04,475 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-09-28 10:19:04,482 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:19:04,861 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-09-28 10:19:04,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:19:04,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:19:04,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-09-28 10:19:04,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:19:04,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:19:04,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:19:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:08,048 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:19:08,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-09-28 10:19:08,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-28 10:19:08,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-28 10:19:08,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-28 10:19:08,050 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-09-28 10:19:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:19:08,606 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-09-28 10:19:08,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-28 10:19:08,606 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-09-28 10:19:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:19:08,608 INFO L225 Difference]: With dead ends: 299 [2018-09-28 10:19:08,608 INFO L226 Difference]: Without dead ends: 298 [2018-09-28 10:19:08,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-28 10:19:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-28 10:19:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-09-28 10:19:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-28 10:19:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-28 10:19:08,614 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-09-28 10:19:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:19:08,614 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-28 10:19:08,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-28 10:19:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-28 10:19:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-28 10:19:08,615 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:19:08,615 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-09-28 10:19:08,615 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:19:08,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:19:08,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-09-28 10:19:08,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:19:08,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:19:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:08,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:19:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:19:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:11,302 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:19:11,302 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-09-28 10:19:11,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:19:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:19:11,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:19:11,405 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-09-28 10:19:11,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:19:11,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:19:11,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:19:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:14,721 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:19:14,721 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-09-28 10:19:14,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-28 10:19:14,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-28 10:19:14,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-28 10:19:14,724 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-09-28 10:19:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:19:15,220 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-09-28 10:19:15,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-28 10:19:15,221 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-09-28 10:19:15,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:19:15,223 INFO L225 Difference]: With dead ends: 303 [2018-09-28 10:19:15,223 INFO L226 Difference]: Without dead ends: 302 [2018-09-28 10:19:15,224 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-09-28 10:19:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-28 10:19:15,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-09-28 10:19:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-28 10:19:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-28 10:19:15,231 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-09-28 10:19:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:19:15,231 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-28 10:19:15,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-28 10:19:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-28 10:19:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-28 10:19:15,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:19:15,233 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-09-28 10:19:15,233 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:19:15,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:19:15,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-09-28 10:19:15,233 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:19:15,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:19:15,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:15,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:19:15,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:19:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:17,943 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:19:17,943 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-09-28 10:19:17,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:19:18,032 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:19:18,032 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:19:18,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:19:18,042 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-09-28 10:19:18,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:19:18,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:19:18,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:19:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:21,436 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:19:21,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-09-28 10:19:21,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-28 10:19:21,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-28 10:19:21,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-28 10:19:21,438 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-09-28 10:19:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:19:21,950 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-09-28 10:19:21,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-28 10:19:21,950 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-09-28 10:19:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:19:21,952 INFO L225 Difference]: With dead ends: 307 [2018-09-28 10:19:21,952 INFO L226 Difference]: Without dead ends: 306 [2018-09-28 10:19:21,954 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-09-28 10:19:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-28 10:19:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-09-28 10:19:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-28 10:19:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-09-28 10:19:21,959 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-09-28 10:19:21,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:19:21,959 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-09-28 10:19:21,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-28 10:19:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-09-28 10:19:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-28 10:19:21,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:19:21,960 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-09-28 10:19:21,961 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:19:21,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:19:21,961 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-09-28 10:19:21,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:19:21,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:19:21,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:21,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:19:21,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:19:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:24,729 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:19:24,729 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-09-28 10:19:24,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:19:25,195 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-09-28 10:19:25,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:19:25,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:19:25,205 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-09-28 10:19:25,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:19:25,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:19:25,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:19:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:28,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:19:28,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2018-09-28 10:19:28,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-28 10:19:28,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-28 10:19:28,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-28 10:19:28,609 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2018-09-28 10:19:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:19:29,165 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-09-28 10:19:29,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-28 10:19:29,166 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2018-09-28 10:19:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:19:29,167 INFO L225 Difference]: With dead ends: 311 [2018-09-28 10:19:29,167 INFO L226 Difference]: Without dead ends: 310 [2018-09-28 10:19:29,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-28 10:19:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-28 10:19:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-09-28 10:19:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-09-28 10:19:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-09-28 10:19:29,173 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2018-09-28 10:19:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:19:29,173 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-09-28 10:19:29,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-28 10:19:29,173 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-09-28 10:19:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-28 10:19:29,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:19:29,174 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2018-09-28 10:19:29,174 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:19:29,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:19:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2018-09-28 10:19:29,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:19:29,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:19:29,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:29,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:19:29,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:19:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:31,943 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:19:31,943 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-09-28 10:19:31,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:19:32,053 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:19:32,053 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:19:32,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:19:32,063 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-09-28 10:19:32,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:19:32,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:19:32,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 Received shutdown request... [2018-09-28 10:19:32,722 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-28 10:19:32,923 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:19:32,923 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-28 10:19:33,040 WARN L206 ceAbstractionStarter]: Timeout [2018-09-28 10:19:33,040 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.09 10:19:33 BoogieIcfgContainer [2018-09-28 10:19:33,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 10:19:33,041 INFO L168 Benchmark]: Toolchain (without parser) took 239961.33 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 555.4 MB. Max. memory is 7.1 GB. [2018-09-28 10:19:33,043 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:19:33,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:19:33,043 INFO L168 Benchmark]: Boogie Preprocessor took 29.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:19:33,043 INFO L168 Benchmark]: RCFGBuilder took 280.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-28 10:19:33,044 INFO L168 Benchmark]: TraceAbstraction took 239578.89 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 534.3 MB. Max. memory is 7.1 GB. [2018-09-28 10:19:33,046 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.27 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 65.30 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 29.91 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 280.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239578.89 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 534.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17). Cancelled while BasicCegarLoop was analyzing trace of length 309 with TraceHistMax 77, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 110 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 239.4s OverallTime, 77 OverallIterations, 77 TraceHistogramMax, 24.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 230 SDtfs, 4233 SDslu, 4299 SDs, 0 SdLazy, 15998 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14551 GetRequests, 8700 SyntacticMatches, 0 SemanticMatches, 5851 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292600 ImplicationChecksByTransitivity, 182.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.6s SsaConstructionTime, 8.7s SatisfiabilityAnalysisTime, 195.4s InterpolantComputationTime, 23404 NumberOfCodeBlocks, 23404 NumberOfCodeBlocksAsserted, 1607 NumberOfCheckSat, 23253 ConstructedInterpolants, 0 QuantifiedInterpolants, 37828463 SizeOfPredicates, 450 NumberOfNonLiveVariables, 21675 ConjunctsInSsa, 9300 ConjunctsInUnsatCore, 151 InterpolantComputations, 1 PerfectInterpolantSequences, 0/579500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-28_10-19-33-056.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-28_10-19-33-056.csv Completed graceful shutdown