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/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 23:46:43,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 23:46:43,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 23:46:43,828 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 23:46:43,829 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 23:46:43,830 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 23:46:43,831 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 23:46:43,833 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 23:46:43,834 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 23:46:43,835 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 23:46:43,837 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 23:46:43,837 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 23:46:43,838 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 23:46:43,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 23:46:43,844 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 23:46:43,845 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 23:46:43,846 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 23:46:43,848 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 23:46:43,855 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 23:46:43,859 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 23:46:43,861 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 23:46:43,862 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 23:46:43,864 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 23:46:43,864 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 23:46:43,864 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 23:46:43,865 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 23:46:43,866 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 23:46:43,867 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 23:46:43,867 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 23:46:43,868 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 23:46:43,869 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 23:46:43,869 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 23:46:43,869 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 23:46:43,870 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 23:46:43,870 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 23:46:43,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 23:46:43,873 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-30 23:46:43,902 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 23:46:43,902 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 23:46:43,903 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 23:46:43,903 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 23:46:43,904 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 23:46:43,904 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 23:46:43,904 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 23:46:43,905 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 23:46:43,905 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 23:46:43,905 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 23:46:43,905 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 23:46:43,906 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 23:46:43,906 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 23:46:43,906 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 23:46:43,906 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 23:46:43,907 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 23:46:43,907 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 23:46:43,907 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 23:46:43,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 23:46:43,909 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 23:46:43,909 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 23:46:43,909 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 23:46:43,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:46:43,910 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 23:46:43,910 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 23:46:43,910 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 23:46:43,911 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 23:46:43,912 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 23:46:43,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 23:46:43,912 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 23:46:43,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 23:46:43,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 23:46:43,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 23:46:43,981 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 23:46:43,982 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 23:46:43,982 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2018-09-30 23:46:43,983 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2018-09-30 23:46:44,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 23:46:44,039 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 23:46:44,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 23:46:44,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 23:46:44,041 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 23:46:44,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:46:44" (1/1) ... [2018-09-30 23:46:44,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:46:44" (1/1) ... [2018-09-30 23:46:44,080 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 23:46:44,080 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 23:46:44,080 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 23:46:44,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 23:46:44,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 23:46:44,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 23:46:44,083 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 23:46:44,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:46:44" (1/1) ... [2018-09-30 23:46:44,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:46:44" (1/1) ... [2018-09-30 23:46:44,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:46:44" (1/1) ... [2018-09-30 23:46:44,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:46:44" (1/1) ... [2018-09-30 23:46:44,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:46:44" (1/1) ... [2018-09-30 23:46:44,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:46:44" (1/1) ... [2018-09-30 23:46:44,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:46:44" (1/1) ... [2018-09-30 23:46:44,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 23:46:44,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 23:46:44,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 23:46:44,107 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 23:46:44,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:46:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:46:44,177 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-30 23:46:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-30 23:46:44,178 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-30 23:46:44,386 INFO L345 CfgBuilder]: Using library mode [2018-09-30 23:46:44,387 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:46:44 BoogieIcfgContainer [2018-09-30 23:46:44,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 23:46:44,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 23:46:44,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 23:46:44,392 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 23:46:44,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:46:44" (1/2) ... [2018-09-30 23:46:44,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc02456 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 11:46:44, skipping insertion in model container [2018-09-30 23:46:44,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:46:44" (2/2) ... [2018-09-30 23:46:44,396 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2018-09-30 23:46:44,407 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 23:46:44,419 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 23:46:44,475 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 23:46:44,476 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 23:46:44,477 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 23:46:44,477 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 23:46:44,477 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 23:46:44,477 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 23:46:44,478 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 23:46:44,478 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 23:46:44,478 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 23:46:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-30 23:46:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-30 23:46:44,517 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:46:44,518 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-30 23:46:44,520 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:46:44,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:46:44,528 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-09-30 23:46:44,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:46:44,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:46:44,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:44,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:46:44,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:46:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:44,698 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:46:44,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:46:44,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:46:44,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:46:44,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:46:44,716 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-30 23:46:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:46:44,769 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-30 23:46:44,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:46:44,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-30 23:46:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:46:44,782 INFO L225 Difference]: With dead ends: 11 [2018-09-30 23:46:44,782 INFO L226 Difference]: Without dead ends: 5 [2018-09-30 23:46:44,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-30 23:46:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-30 23:46:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-30 23:46:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-30 23:46:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-30 23:46:44,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-30 23:46:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:46:44,822 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-30 23:46:44,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:46:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-30 23:46:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 23:46:44,822 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:46:44,823 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 23:46:44,823 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:46:44,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:46:44,823 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-09-30 23:46:44,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:46:44,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:46:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:44,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:46:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:46:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:45,164 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:46:45,164 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:46:45,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:46:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:46:45,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:46:45,415 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-30 23:46:45,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:45,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:45,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 23:46:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:45,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:46:45,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-09-30 23:46:45,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:46:45,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:46:45,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:46:45,645 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-09-30 23:46:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:46:45,880 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-30 23:46:45,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 23:46:45,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-09-30 23:46:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:46:45,881 INFO L225 Difference]: With dead ends: 8 [2018-09-30 23:46:45,881 INFO L226 Difference]: Without dead ends: 6 [2018-09-30 23:46:45,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:46:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-30 23:46:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-30 23:46:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-30 23:46:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-30 23:46:45,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-30 23:46:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:46:45,885 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-30 23:46:45,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:46:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-30 23:46:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 23:46:45,886 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:46:45,887 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-30 23:46:45,887 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:46:45,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:46:45,888 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-09-30 23:46:45,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:46:45,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:46:45,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:45,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:46:45,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:46:46,164 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-09-30 23:46:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:46,266 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:46:46,267 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:46:46,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:46:46,288 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:46:46,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:46:46,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:46:46,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 23:46:46,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:46,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:46,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 23:46:46,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-09-30 23:46:46,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:46,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:46,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 23:46:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:46,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:46:46,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-30 23:46:46,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:46:46,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:46:46,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:46:46,646 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2018-09-30 23:46:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:46:46,756 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-30 23:46:46,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 23:46:46,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-09-30 23:46:46,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:46:46,758 INFO L225 Difference]: With dead ends: 9 [2018-09-30 23:46:46,758 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 23:46:46,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:46:46,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 23:46:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-30 23:46:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-30 23:46:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-30 23:46:46,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-30 23:46:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:46:46,762 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-30 23:46:46,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:46:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-30 23:46:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 23:46:46,763 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:46:46,763 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-30 23:46:46,764 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:46:46,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:46:46,764 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-09-30 23:46:46,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:46:46,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:46:46,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:46,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:46:46,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:46:47,394 WARN L178 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-09-30 23:46:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:47,418 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:46:47,419 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:46:47,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:46:47,439 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-30 23:46:47,439 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:46:47,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:46:47,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 23:46:47,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:47,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:47,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 23:46:47,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-09-30 23:46:47,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:47,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:47,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 23:46:47,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-30 23:46:47,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:47,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:47,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 23:46:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:47,736 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:46:47,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-30 23:46:47,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 23:46:47,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 23:46:47,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-09-30 23:46:47,738 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2018-09-30 23:46:47,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:46:47,842 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-30 23:46:47,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 23:46:47,843 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-09-30 23:46:47,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:46:47,843 INFO L225 Difference]: With dead ends: 10 [2018-09-30 23:46:47,844 INFO L226 Difference]: Without dead ends: 8 [2018-09-30 23:46:47,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-09-30 23:46:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-30 23:46:47,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-30 23:46:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-30 23:46:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-30 23:46:47,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-30 23:46:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:46:47,848 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-30 23:46:47,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 23:46:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-30 23:46:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 23:46:47,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:46:47,849 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-30 23:46:47,849 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:46:47,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:46:47,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-09-30 23:46:47,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:46:47,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:46:47,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:47,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:46:47,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:46:48,183 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 20 [2018-09-30 23:46:48,373 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-09-30 23:46:48,408 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-30 23:46:48,408 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:46:48,408 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:46:48,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:46:48,424 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:46:48,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:46:48,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:46:48,537 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-30 23:46:48,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:48,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:48,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 23:46:48,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-09-30 23:46:48,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:48,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:48,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 23:46:48,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-30 23:46:48,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:48,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:48,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 23:46:48,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-09-30 23:46:48,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:48,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:48,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-30 23:46:48,968 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-30 23:46:48,989 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:46:48,989 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 23:46:48,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:46:48,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:46:48,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:46:48,991 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2018-09-30 23:46:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:46:49,225 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-30 23:46:49,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 23:46:49,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2018-09-30 23:46:49,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:46:49,227 INFO L225 Difference]: With dead ends: 11 [2018-09-30 23:46:49,227 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 23:46:49,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:46:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 23:46:49,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-30 23:46:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 23:46:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-30 23:46:49,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-30 23:46:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:46:49,234 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-30 23:46:49,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:46:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-30 23:46:49,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:46:49,235 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:46:49,235 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-30 23:46:49,235 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:46:49,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:46:49,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-09-30 23:46:49,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:46:49,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:46:49,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:49,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:46:49,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:46:49,855 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2018-09-30 23:46:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:49,876 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:46:49,876 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:46:49,886 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:46:49,901 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-30 23:46:49,901 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:46:49,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:46:49,932 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-30 23:46:49,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:49,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:49,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 23:46:49,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-09-30 23:46:49,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:50,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:50,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 23:46:50,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-30 23:46:50,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:50,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:50,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 23:46:50,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-09-30 23:46:50,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:50,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:50,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-30 23:46:50,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-09-30 23:46:50,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:50,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:50,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-30 23:46:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:50,571 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:46:50,571 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 23:46:50,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 23:46:50,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 23:46:50,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:46:50,573 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2018-09-30 23:46:51,174 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-09-30 23:46:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:46:51,189 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-30 23:46:51,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 23:46:51,190 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2018-09-30 23:46:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:46:51,191 INFO L225 Difference]: With dead ends: 12 [2018-09-30 23:46:51,191 INFO L226 Difference]: Without dead ends: 10 [2018-09-30 23:46:51,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:46:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-30 23:46:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-30 23:46:51,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-30 23:46:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-30 23:46:51,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-30 23:46:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:46:51,195 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-30 23:46:51,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 23:46:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-30 23:46:51,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:46:51,196 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:46:51,196 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-30 23:46:51,196 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:46:51,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:46:51,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-09-30 23:46:51,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:46:51,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:46:51,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:51,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:46:51,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:46:51,859 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2018-09-30 23:46:52,163 WARN L178 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2018-09-30 23:46:52,191 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-30 23:46:52,192 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:46:52,192 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:46:52,206 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:46:52,218 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-09-30 23:46:52,219 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:46:52,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:46:52,232 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-30 23:46:52,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:52,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:52,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 23:46:52,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-09-30 23:46:52,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:52,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:52,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 23:46:52,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-30 23:46:52,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:52,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:52,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 23:46:52,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-09-30 23:46:52,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:52,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:52,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-30 23:46:52,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-09-30 23:46:52,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:52,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:52,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-30 23:46:52,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-09-30 23:46:52,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:52,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-09-30 23:46:52,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-30 23:46:55,126 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-30 23:46:55,147 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:46:55,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-30 23:46:55,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 23:46:55,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 23:46:55,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-09-30 23:46:55,149 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2018-09-30 23:46:59,625 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-09-30 23:46:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:46:59,637 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-30 23:46:59,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 23:46:59,637 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2018-09-30 23:46:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:46:59,638 INFO L225 Difference]: With dead ends: 13 [2018-09-30 23:46:59,638 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 23:46:59,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=86, Invalid=255, Unknown=1, NotChecked=0, Total=342 [2018-09-30 23:46:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 23:46:59,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 23:46:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 23:46:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-30 23:46:59,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-30 23:46:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:46:59,644 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-30 23:46:59,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 23:46:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-30 23:46:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 23:46:59,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:46:59,644 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-30 23:46:59,645 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:46:59,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:46:59,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-09-30 23:46:59,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:46:59,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:46:59,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:59,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:46:59,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:47:00,089 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2018-09-30 23:47:00,419 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 29 [2018-09-30 23:47:00,712 WARN L178 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2018-09-30 23:47:00,997 WARN L178 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2018-09-30 23:47:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:47:01,020 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:47:01,020 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:47:01,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:47:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:47:01,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:47:01,064 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-30 23:47:01,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:01,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-30 23:47:01,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 23:47:01,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-09-30 23:47:01,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:01,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-30 23:47:01,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 23:47:01,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-30 23:47:01,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:01,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-30 23:47:01,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 23:47:01,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-09-30 23:47:01,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:01,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-30 23:47:01,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-30 23:47:01,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-09-30 23:47:01,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:01,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-30 23:47:01,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-30 23:47:01,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-09-30 23:47:01,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:01,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-09-30 23:47:01,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-30 23:47:04,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-09-30 23:47:04,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:04,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-09-30 23:47:04,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-09-30 23:47:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:47:20,163 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:47:20,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-30 23:47:20,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 23:47:20,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 23:47:20,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=285, Unknown=5, NotChecked=0, Total=380 [2018-09-30 23:47:20,165 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2018-09-30 23:47:26,745 WARN L178 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2018-09-30 23:47:37,389 WARN L178 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-09-30 23:47:57,287 WARN L178 SmtUtils]: Spent 4.89 s on a formula simplification that was a NOOP. DAG size: 48 [2018-09-30 23:47:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:47:57,310 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-30 23:47:57,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:47:57,310 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2018-09-30 23:47:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:47:57,311 INFO L225 Difference]: With dead ends: 14 [2018-09-30 23:47:57,311 INFO L226 Difference]: Without dead ends: 12 [2018-09-30 23:47:57,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 48.0s TimeCoverageRelationStatistics Valid=158, Invalid=481, Unknown=11, NotChecked=0, Total=650 [2018-09-30 23:47:57,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-30 23:47:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-30 23:47:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-30 23:47:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-30 23:47:57,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-30 23:47:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:47:57,317 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-30 23:47:57,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 23:47:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-30 23:47:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:47:57,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:47:57,318 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-30 23:47:57,318 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:47:57,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:47:57,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2018-09-30 23:47:57,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:47:57,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:47:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:47:57,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:47:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:47:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:47:58,113 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 25 [2018-09-30 23:47:58,380 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 29 [2018-09-30 23:47:58,830 WARN L178 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 44 [2018-09-30 23:47:59,454 WARN L178 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 57 [2018-09-30 23:47:59,534 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-30 23:47:59,534 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:47:59,535 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:47:59,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:47:59,583 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:47:59,584 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:47:59,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:47:59,638 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-30 23:47:59,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:59,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-30 23:47:59,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 23:47:59,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-09-30 23:47:59,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:59,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-30 23:47:59,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 23:47:59,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-30 23:47:59,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:59,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-30 23:47:59,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 23:47:59,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-09-30 23:47:59,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:59,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-30 23:47:59,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-30 23:47:59,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-09-30 23:47:59,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:59,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-30 23:47:59,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-30 23:48:00,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-09-30 23:48:00,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:48:00,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-09-30 23:48:00,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-30 23:48:03,082 INFO L303 Elim1Store]: Index analysis took 139 ms [2018-09-30 23:48:03,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-09-30 23:48:03,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:48:03,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-09-30 23:48:03,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-09-30 23:48:16,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-09-30 23:48:16,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:48:16,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-09-30 23:48:16,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 [2018-09-30 23:48:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 34 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:48:51,027 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:48:51,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-30 23:48:51,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 23:48:51,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 23:48:51,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=336, Unknown=16, NotChecked=0, Total=462 [2018-09-30 23:48:51,029 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 22 states. [2018-09-30 23:48:52,900 WARN L178 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2018-09-30 23:49:11,326 WARN L178 SmtUtils]: Spent 12.11 s on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2018-09-30 23:49:37,032 WARN L178 SmtUtils]: Spent 11.96 s on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2018-09-30 23:50:27,033 WARN L178 SmtUtils]: Spent 12.16 s on a formula simplification. DAG size of input: 101 DAG size of output: 53 [2018-09-30 23:50:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:50:27,059 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-30 23:50:27,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 23:50:27,060 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 11 [2018-09-30 23:50:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:50:27,060 INFO L225 Difference]: With dead ends: 15 [2018-09-30 23:50:27,061 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 23:50:27,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 127.8s TimeCoverageRelationStatistics Valid=156, Invalid=517, Unknown=29, NotChecked=0, Total=702 [2018-09-30 23:50:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 23:50:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-30 23:50:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 23:50:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-30 23:50:27,066 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-30 23:50:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:50:27,067 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-30 23:50:27,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 23:50:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-30 23:50:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:50:27,067 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:50:27,068 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-30 23:50:27,068 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:50:27,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:50:27,068 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2018-09-30 23:50:27,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:50:27,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:50:27,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:50:27,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:50:27,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:50:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:50:27,601 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-09-30 23:50:27,774 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2018-09-30 23:50:28,026 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 31 [2018-09-30 23:50:28,420 WARN L178 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 34 [2018-09-30 23:50:29,259 WARN L178 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 52 [2018-09-30 23:50:29,938 WARN L178 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 59 [2018-09-30 23:50:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:50:29,971 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:50:29,971 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:50:29,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:50:29,999 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-30 23:50:30,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:50:30,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:50:30,052 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-30 23:50:30,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:50:30,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-30 23:50:30,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 23:50:30,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-09-30 23:50:30,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:50:30,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-30 23:50:30,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 23:50:30,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-30 23:50:30,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:50:30,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-30 23:50:30,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 23:50:30,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-09-30 23:50:30,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:50:30,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-30 23:50:30,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-30 23:50:30,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-09-30 23:50:30,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:50:30,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-30 23:50:30,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-30 23:50:30,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-09-30 23:50:30,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:50:30,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-09-30 23:50:30,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-30 23:50:33,652 INFO L303 Elim1Store]: Index analysis took 124 ms [2018-09-30 23:50:33,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-09-30 23:50:33,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:50:33,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-09-30 23:50:33,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-09-30 23:50:49,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-09-30 23:50:49,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:50:49,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-09-30 23:50:49,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 [2018-09-30 23:51:17,920 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-09-30 23:51:17,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-09-30 23:51:17,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:51:17,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-09-30 23:51:17,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:95, output treesize:94 [2018-09-30 23:52:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 40 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:52:09,945 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:52:09,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-30 23:52:09,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-30 23:52:09,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-30 23:52:09,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=397, Unknown=33, NotChecked=0, Total=552 [2018-09-30 23:52:09,947 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 24 states. [2018-09-30 23:52:12,229 WARN L178 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-09-30 23:52:27,597 WARN L178 SmtUtils]: Spent 12.15 s on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2018-09-30 23:52:56,166 WARN L178 SmtUtils]: Spent 18.29 s on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2018-09-30 23:53:29,608 WARN L178 SmtUtils]: Spent 18.35 s on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2018-09-30 23:54:04,274 WARN L178 SmtUtils]: Spent 12.06 s on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2018-09-30 23:54:25,382 WARN L178 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 102 DAG size of output: 55 [2018-09-30 23:55:13,310 WARN L178 SmtUtils]: Spent 12.17 s on a formula simplification. DAG size of input: 107 DAG size of output: 58 [2018-09-30 23:55:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:55:13,454 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-30 23:55:13,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 23:55:13,455 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 12 [2018-09-30 23:55:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:55:13,456 INFO L225 Difference]: With dead ends: 16 [2018-09-30 23:55:13,456 INFO L226 Difference]: Without dead ends: 14 [2018-09-30 23:55:13,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 239.1s TimeCoverageRelationStatistics Valid=191, Invalid=686, Unknown=53, NotChecked=0, Total=930 [2018-09-30 23:55:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-30 23:55:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-30 23:55:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-30 23:55:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-30 23:55:13,465 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-30 23:55:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:55:13,466 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-30 23:55:13,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-30 23:55:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-30 23:55:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 23:55:13,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:55:13,467 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-09-30 23:55:13,467 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:55:13,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:55:13,467 INFO L82 PathProgramCache]: Analyzing trace with hash -258347808, now seen corresponding path program 10 times [2018-09-30 23:55:13,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:55:13,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:55:13,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:55:13,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:55:13,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:55:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:55:14,072 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-09-30 23:55:14,254 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-09-30 23:55:14,538 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 32 [2018-09-30 23:55:15,091 WARN L178 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 35 [2018-09-30 23:55:15,462 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 51 [2018-09-30 23:55:15,956 WARN L178 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 61 [2018-09-30 23:55:16,756 WARN L178 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 327 DAG size of output: 56 [2018-09-30 23:55:17,376 WARN L178 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 440 DAG size of output: 80 [2018-09-30 23:55:17,435 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-30 23:55:17,436 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:55:17,436 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:55:17,445 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:55:17,456 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:55:17,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:55:17,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:55:17,485 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-30 23:55:17,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:55:17,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-30 23:55:17,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 23:55:17,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-09-30 23:55:17,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:55:17,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-30 23:55:17,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 23:55:17,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-30 23:55:17,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:55:17,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-30 23:55:17,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 23:55:17,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-09-30 23:55:17,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:55:17,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-30 23:55:17,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-30 23:55:17,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-09-30 23:55:17,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:55:17,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-30 23:55:17,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-30 23:55:18,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-09-30 23:55:18,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:55:18,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-09-30 23:55:18,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-30 23:55:23,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-09-30 23:55:23,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:55:23,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-09-30 23:55:23,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-09-30 23:55:36,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-09-30 23:55:36,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:55:36,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-09-30 23:55:36,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 [2018-09-30 23:55:59,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-09-30 23:55:59,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:55:59,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-09-30 23:55:59,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:95, output treesize:94 [2018-09-30 23:56:32,597 INFO L303 Elim1Store]: Index analysis took 157 ms [2018-09-30 23:56:32,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-09-30 23:56:32,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:56:32,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2018-09-30 23:56:32,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:105, output treesize:104 [2018-09-30 23:57:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 46 refuted. 9 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:57:31,509 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:57:31,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-30 23:57:31,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-30 23:57:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-30 23:57:31,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=461, Unknown=45, NotChecked=0, Total=650 [2018-09-30 23:57:31,511 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 26 states. [2018-09-30 23:57:43,958 WARN L178 SmtUtils]: Spent 12.17 s on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-09-30 23:58:13,882 WARN L178 SmtUtils]: Spent 24.58 s on a formula simplification. DAG size of input: 125 DAG size of output: 69 [2018-09-30 23:59:07,467 WARN L178 SmtUtils]: Spent 37.05 s on a formula simplification. DAG size of input: 113 DAG size of output: 71 [2018-10-01 00:00:08,636 WARN L178 SmtUtils]: Spent 37.02 s on a formula simplification. DAG size of input: 134 DAG size of output: 69 [2018-10-01 00:00:52,749 WARN L178 SmtUtils]: Spent 18.44 s on a formula simplification. DAG size of input: 114 DAG size of output: 68 [2018-10-01 00:01:28,536 WARN L178 SmtUtils]: Spent 12.32 s on a formula simplification. DAG size of input: 164 DAG size of output: 63 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown