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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:13:48,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:13:48,112 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:13:48,129 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:13:48,129 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:13:48,131 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:13:48,134 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:13:48,137 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:13:48,141 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:13:48,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:13:48,146 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:13:48,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:13:48,147 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:13:48,148 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:13:48,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:13:48,153 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:13:48,153 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:13:48,162 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:13:48,164 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:13:48,171 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:13:48,172 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:13:48,173 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:13:48,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:13:48,177 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:13:48,177 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:13:48,180 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:13:48,182 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:13:48,182 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:13:48,183 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:13:48,184 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:13:48,185 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:13:48,185 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:13:48,186 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:13:48,186 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:13:48,187 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:13:48,187 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:13:48,188 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:13:48,209 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:13:48,209 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:13:48,210 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:13:48,210 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:13:48,211 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:13:48,211 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:13:48,211 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:13:48,212 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:13:48,212 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:13:48,212 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:13:48,212 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:13:48,212 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:13:48,213 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:13:48,213 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:13:48,213 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:13:48,213 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:13:48,213 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:13:48,213 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:13:48,214 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:13:48,214 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:13:48,214 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:13:48,214 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:13:48,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:13:48,215 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:13:48,215 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:13:48,215 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:13:48,215 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:13:48,215 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:13:48,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:13:48,216 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:13:48,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:13:48,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:13:48,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:13:48,282 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:13:48,282 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:13:48,283 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2018-10-04 12:13:48,283 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2018-10-04 12:13:48,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:13:48,329 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:13:48,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:13:48,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:13:48,330 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:13:48,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:48" (1/1) ... [2018-10-04 12:13:48,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:48" (1/1) ... [2018-10-04 12:13:48,366 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:13:48,366 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:13:48,366 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:13:48,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:13:48,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:13:48,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:13:48,369 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:13:48,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:48" (1/1) ... [2018-10-04 12:13:48,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:48" (1/1) ... [2018-10-04 12:13:48,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:48" (1/1) ... [2018-10-04 12:13:48,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:48" (1/1) ... [2018-10-04 12:13:48,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:48" (1/1) ... [2018-10-04 12:13:48,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:48" (1/1) ... [2018-10-04 12:13:48,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:48" (1/1) ... [2018-10-04 12:13:48,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:13:48,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:13:48,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:13:48,392 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:13:48,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:13:48,463 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 12:13:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 12:13:48,463 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 12:13:48,658 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:13:48,659 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:13:48 BoogieIcfgContainer [2018-10-04 12:13:48,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:13:48,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:13:48,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:13:48,665 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:13:48,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:48" (1/2) ... [2018-10-04 12:13:48,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aaf71c2 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:13:48, skipping insertion in model container [2018-10-04 12:13:48,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:13:48" (2/2) ... [2018-10-04 12:13:48,669 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2018-10-04 12:13:48,680 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:13:48,693 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:13:48,747 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:13:48,748 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:13:48,748 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:13:48,748 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:13:48,748 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:13:48,749 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:13:48,749 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:13:48,749 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:13:48,749 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:13:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-04 12:13:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:13:48,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:48,769 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:13:48,770 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:48,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-10-04 12:13:48,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:48,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:48,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:48,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:48,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:49,280 WARN L178 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-10-04 12:13:49,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:49,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:49,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:13:49,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:13:49,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:13:49,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:13:49,364 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-10-04 12:13:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:49,517 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 12:13:49,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:13:49,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-10-04 12:13:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:49,530 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:13:49,531 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:13:49,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:13:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:13:49,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-10-04 12:13:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 12:13:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 12:13:49,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-10-04 12:13:49,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:49,565 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 12:13:49,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:13:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 12:13:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:13:49,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:49,566 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-10-04 12:13:49,566 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:49,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:49,567 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-10-04 12:13:49,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:49,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:49,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:49,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:49,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:49,963 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-10-04 12:13:50,267 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-10-04 12:13:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:50,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:50,270 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:50,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:50,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:50,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-04 12:13:50,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:50,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:50,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:13:50,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:13:50,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:50,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:50,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:13:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:50,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:50,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 12:13:50,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:13:50,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:13:50,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:13:50,619 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-10-04 12:13:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:50,690 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 12:13:50,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:13:50,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-10-04 12:13:50,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:50,691 INFO L225 Difference]: With dead ends: 10 [2018-10-04 12:13:50,691 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:13:50,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:13:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:13:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-10-04 12:13:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:13:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 12:13:50,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-10-04 12:13:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:50,696 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 12:13:50,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:13:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 12:13:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:13:50,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:50,698 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-10-04 12:13:50,698 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:50,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:50,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-10-04 12:13:50,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:50,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:50,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:50,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:50,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:51,255 WARN L178 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-04 12:13:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:51,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:51,396 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:51,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:13:51,413 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:13:51,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:13:51,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:51,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-04 12:13:51,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:51,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:51,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:13:51,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:13:51,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:51,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:51,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:13:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:51,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:51,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-04 12:13:51,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:13:51,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:13:51,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:13:51,626 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2018-10-04 12:13:51,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:51,686 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 12:13:51,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:13:51,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-10-04 12:13:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:51,688 INFO L225 Difference]: With dead ends: 12 [2018-10-04 12:13:51,689 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:13:51,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:13:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:13:51,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-10-04 12:13:51,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:13:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 12:13:51,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-10-04 12:13:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:51,694 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 12:13:51,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:13:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 12:13:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:13:51,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:51,695 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-10-04 12:13:51,695 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:51,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:51,695 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-10-04 12:13:51,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:51,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:51,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:51,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:13:51,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:52,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:52,082 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:52,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:13:52,100 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:13:52,100 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:13:52,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:52,107 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 8 treesize of output 7 [2018-10-04 12:13:52,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:52,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:52,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:13:52,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:13:52,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:52,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:52,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:13:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:52,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:52,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 12:13:52,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:13:52,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:13:52,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:13:52,319 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2018-10-04 12:13:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:52,423 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 12:13:52,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:13:52,426 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-10-04 12:13:52,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:52,427 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:13:52,427 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:13:52,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:13:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:13:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-10-04 12:13:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:13:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 12:13:52,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-10-04 12:13:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:52,432 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 12:13:52,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:13:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 12:13:52,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:13:52,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:52,433 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-10-04 12:13:52,433 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:52,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:52,434 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-10-04 12:13:52,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:52,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:52,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:52,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:13:52,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:52,817 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-10-04 12:13:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:52,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:52,902 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:52,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:13:52,947 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:13:52,947 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:13:52,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:52,969 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 8 treesize of output 7 [2018-10-04 12:13:52,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:53,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:53,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:13:53,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:13:53,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:53,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:53,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:13:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:53,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:53,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:13:53,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:13:53,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:13:53,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:13:53,322 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2018-10-04 12:13:53,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:53,475 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-04 12:13:53,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:13:53,475 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2018-10-04 12:13:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:53,476 INFO L225 Difference]: With dead ends: 16 [2018-10-04 12:13:53,477 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:13:53,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:13:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:13:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-10-04 12:13:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:13:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-04 12:13:53,482 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-10-04 12:13:53,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:53,483 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-04 12:13:53,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:13:53,483 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-04 12:13:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:13:53,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:53,484 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-10-04 12:13:53,484 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:53,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:53,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-10-04 12:13:53,485 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:53,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:53,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:53,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:13:53,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:53,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:53,812 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:53,822 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:13:53,836 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:13:53,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:13:53,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:53,850 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 8 treesize of output 7 [2018-10-04 12:13:53,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:53,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:53,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:13:54,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:13:54,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:54,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:54,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:13:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:54,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:54,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 12:13:54,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:13:54,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:13:54,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:13:54,122 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2018-10-04 12:13:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:54,284 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-04 12:13:54,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:13:54,285 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2018-10-04 12:13:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:54,286 INFO L225 Difference]: With dead ends: 18 [2018-10-04 12:13:54,287 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:13:54,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:13:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:13:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-10-04 12:13:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:13:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 12:13:54,292 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-10-04 12:13:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:54,293 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-04 12:13:54,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:13:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 12:13:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:13:54,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:54,294 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-10-04 12:13:54,295 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:54,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-10-04 12:13:54,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:54,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:54,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:54,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:13:54,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:54,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:54,686 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:54,695 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:13:54,713 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:13:54,713 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:13:54,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:54,721 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 8 treesize of output 7 [2018-10-04 12:13:54,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:54,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:54,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:13:55,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:13:55,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:55,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:55,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:13:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:55,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:55,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-04 12:13:55,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:13:55,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:13:55,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:13:55,101 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2018-10-04 12:13:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:55,345 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-04 12:13:55,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:13:55,347 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2018-10-04 12:13:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:55,347 INFO L225 Difference]: With dead ends: 20 [2018-10-04 12:13:55,348 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:13:55,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:13:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:13:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-10-04 12:13:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:13:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-04 12:13:55,352 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-10-04 12:13:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:55,353 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-04 12:13:55,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:13:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-04 12:13:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:13:55,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:55,354 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-10-04 12:13:55,354 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:55,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:55,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-10-04 12:13:55,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:55,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:55,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:55,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:13:55,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:55,707 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:13:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:56,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:56,296 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:56,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:56,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:56,348 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 8 treesize of output 7 [2018-10-04 12:13:56,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:56,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:56,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:13:57,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:13:57,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:57,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:57,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:13:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:57,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:57,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 12:13:57,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:13:57,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:13:57,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:13:57,085 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2018-10-04 12:13:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:57,511 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-04 12:13:57,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:13:57,511 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2018-10-04 12:13:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:57,513 INFO L225 Difference]: With dead ends: 22 [2018-10-04 12:13:57,513 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:13:57,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:13:57,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:13:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-10-04 12:13:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:13:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-04 12:13:57,519 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-10-04 12:13:57,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:57,519 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-04 12:13:57,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:13:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-04 12:13:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:13:57,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:57,520 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-10-04 12:13:57,520 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:57,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:57,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-10-04 12:13:57,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:57,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:57,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:57,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:57,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:57,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:57,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:57,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:13:57,957 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:13:57,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:13:57,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:57,961 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 8 treesize of output 7 [2018-10-04 12:13:57,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:57,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:57,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:13:58,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:13:58,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:58,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:58,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:13:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:58,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:58,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-04 12:13:58,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 12:13:58,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 12:13:58,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:13:58,230 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2018-10-04 12:13:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:58,576 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-04 12:13:58,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:13:58,577 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-10-04 12:13:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:58,578 INFO L225 Difference]: With dead ends: 24 [2018-10-04 12:13:58,578 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:13:58,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:13:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:13:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-10-04 12:13:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:13:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 12:13:58,584 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-10-04 12:13:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:58,584 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 12:13:58,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 12:13:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 12:13:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:13:58,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:58,585 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-10-04 12:13:58,585 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:58,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:58,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-10-04 12:13:58,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:58,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:58,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:58,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:13:58,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:58,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:58,983 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:58,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:13:59,003 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 12:13:59,003 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:13:59,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:59,009 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 8 treesize of output 7 [2018-10-04 12:13:59,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:59,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:59,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:13:59,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:13:59,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:13:59,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:13:59,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:13:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:59,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:59,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-04 12:13:59,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 12:13:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 12:13:59,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:13:59,312 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2018-10-04 12:13:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:59,569 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 12:13:59,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:13:59,569 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2018-10-04 12:13:59,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:59,570 INFO L225 Difference]: With dead ends: 26 [2018-10-04 12:13:59,571 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:13:59,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:13:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:13:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-10-04 12:13:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:13:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-04 12:13:59,577 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-10-04 12:13:59,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:59,577 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-04 12:13:59,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 12:13:59,578 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-04 12:13:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:13:59,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:59,579 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-10-04 12:13:59,579 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:59,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-10-04 12:13:59,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:59,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:59,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:59,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:13:59,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:00,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:00,366 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:00,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:14:00,384 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:14:00,385 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:00,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:00,391 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 8 treesize of output 7 [2018-10-04 12:14:00,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:00,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:00,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:00,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:00,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:00,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:00,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:00,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:00,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-04 12:14:00,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 12:14:00,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 12:14:00,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:14:00,745 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2018-10-04 12:14:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:01,061 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-04 12:14:01,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:14:01,061 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-10-04 12:14:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:01,063 INFO L225 Difference]: With dead ends: 28 [2018-10-04 12:14:01,063 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:14:01,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:14:01,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:14:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-10-04 12:14:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:14:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-04 12:14:01,070 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-10-04 12:14:01,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:01,070 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-04 12:14:01,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 12:14:01,071 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-04 12:14:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 12:14:01,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:01,071 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-10-04 12:14:01,072 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:01,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:01,072 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-10-04 12:14:01,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:01,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:01,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:01,333 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:14:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:01,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:01,804 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:01,811 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:14:01,831 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 12:14:01,831 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:01,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:01,836 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 8 treesize of output 7 [2018-10-04 12:14:01,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:01,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:01,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:02,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:02,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:02,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:02,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:02,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:02,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-04 12:14:02,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 12:14:02,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 12:14:02,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2018-10-04 12:14:02,308 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2018-10-04 12:14:02,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:02,750 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-04 12:14:02,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:14:02,751 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2018-10-04 12:14:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:02,752 INFO L225 Difference]: With dead ends: 30 [2018-10-04 12:14:02,752 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:14:02,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2018-10-04 12:14:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:14:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-10-04 12:14:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:14:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-04 12:14:02,757 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-10-04 12:14:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:02,758 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-04 12:14:02,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 12:14:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-04 12:14:02,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 12:14:02,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:02,758 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-10-04 12:14:02,759 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:02,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:02,759 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-10-04 12:14:02,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:02,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:02,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:02,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:02,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:03,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:03,386 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:03,401 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:14:03,433 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:14:03,434 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:03,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:03,451 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 8 treesize of output 7 [2018-10-04 12:14:03,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:03,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:03,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:03,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:03,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:03,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:03,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:03,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:03,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-04 12:14:03,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 12:14:03,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 12:14:03,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-10-04 12:14:03,886 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2018-10-04 12:14:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:04,435 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-04 12:14:04,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:14:04,436 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2018-10-04 12:14:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:04,436 INFO L225 Difference]: With dead ends: 32 [2018-10-04 12:14:04,437 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:14:04,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-10-04 12:14:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:14:04,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-10-04 12:14:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:14:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-04 12:14:04,443 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-10-04 12:14:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:04,443 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-04 12:14:04,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 12:14:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-04 12:14:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 12:14:04,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:04,444 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-10-04 12:14:04,444 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:04,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:04,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-10-04 12:14:04,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:04,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:04,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:04,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:04,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:05,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:05,236 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:05,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:05,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:05,260 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 8 treesize of output 7 [2018-10-04 12:14:05,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:05,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:05,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:05,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:05,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:05,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:05,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:05,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:05,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-04 12:14:05,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 12:14:05,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 12:14:05,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 12:14:05,721 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2018-10-04 12:14:06,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:06,575 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-04 12:14:06,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:14:06,576 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2018-10-04 12:14:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:06,577 INFO L225 Difference]: With dead ends: 34 [2018-10-04 12:14:06,577 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:14:06,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 12:14:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:14:06,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-10-04 12:14:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:14:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 12:14:06,584 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-10-04 12:14:06,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:06,584 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 12:14:06,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 12:14:06,585 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 12:14:06,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 12:14:06,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:06,586 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-10-04 12:14:06,586 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:06,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:06,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-10-04 12:14:06,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:06,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:06,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:06,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:06,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:07,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:07,213 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:07,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:14:07,247 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:14:07,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:07,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:07,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-04 12:14:07,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:07,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:07,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:07,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:07,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:07,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:07,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:07,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:07,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-04 12:14:07,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 12:14:07,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 12:14:07,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 12:14:07,763 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2018-10-04 12:14:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:08,270 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 12:14:08,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:14:08,271 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2018-10-04 12:14:08,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:08,272 INFO L225 Difference]: With dead ends: 36 [2018-10-04 12:14:08,272 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:14:08,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 12:14:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:14:08,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-10-04 12:14:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:14:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-04 12:14:08,279 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-10-04 12:14:08,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:08,280 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-04 12:14:08,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 12:14:08,280 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-04 12:14:08,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:14:08,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:08,281 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-10-04 12:14:08,281 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:08,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:08,281 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-10-04 12:14:08,281 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:08,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:08,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:08,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:08,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:08,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:08,827 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:08,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:14:08,853 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 12:14:08,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:08,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:08,868 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 8 treesize of output 7 [2018-10-04 12:14:08,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:08,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:08,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:09,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:09,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:09,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:09,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:09,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:09,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-04 12:14:09,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 12:14:09,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 12:14:09,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:14:09,619 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2018-10-04 12:14:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:10,484 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-04 12:14:10,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:14:10,484 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2018-10-04 12:14:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:10,485 INFO L225 Difference]: With dead ends: 38 [2018-10-04 12:14:10,485 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:14:10,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:14:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:14:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-04 12:14:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 12:14:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-04 12:14:10,492 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-10-04 12:14:10,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:10,492 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-04 12:14:10,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 12:14:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-04 12:14:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 12:14:10,493 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:10,493 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-10-04 12:14:10,493 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:10,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:10,493 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-10-04 12:14:10,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:10,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:10,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:10,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:10,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:10,746 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:14:10,972 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-04 12:14:11,231 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:14:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:11,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:11,879 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:11,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:14:11,896 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:14:11,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:11,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:11,902 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 8 treesize of output 7 [2018-10-04 12:14:11,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:11,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:11,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:12,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:12,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:12,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:12,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:12,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:12,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-04 12:14:12,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 12:14:12,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 12:14:12,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1386, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 12:14:12,479 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2018-10-04 12:14:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:13,266 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-04 12:14:13,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:14:13,267 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2018-10-04 12:14:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:13,268 INFO L225 Difference]: With dead ends: 40 [2018-10-04 12:14:13,268 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:14:13,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=96, Invalid=1386, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 12:14:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:14:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-10-04 12:14:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 12:14:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-04 12:14:13,274 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-10-04 12:14:13,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:13,277 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-04 12:14:13,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 12:14:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-04 12:14:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 12:14:13,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:13,278 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-10-04 12:14:13,278 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:13,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:13,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-10-04 12:14:13,279 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:13,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:13,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:13,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:13,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:13,539 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:14:13,813 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:14:14,115 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:14:14,324 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:14:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:15,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:15,228 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:15,235 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:14:15,267 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 12:14:15,267 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:15,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:15,271 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 8 treesize of output 7 [2018-10-04 12:14:15,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:15,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:15,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:16,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:16,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:16,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:16,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:16,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:16,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-04 12:14:16,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 12:14:16,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 12:14:16,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1539, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 12:14:16,075 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2018-10-04 12:14:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:16,846 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-04 12:14:16,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:14:16,847 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2018-10-04 12:14:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:16,847 INFO L225 Difference]: With dead ends: 42 [2018-10-04 12:14:16,848 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:14:16,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=101, Invalid=1539, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 12:14:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:14:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-10-04 12:14:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 12:14:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-04 12:14:16,855 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-10-04 12:14:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:16,855 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-04 12:14:16,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 12:14:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-04 12:14:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 12:14:16,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:16,856 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-10-04 12:14:16,857 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:16,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:16,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-10-04 12:14:16,857 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:16,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:16,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:16,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:16,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:18,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:18,061 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:18,068 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:14:18,094 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 12:14:18,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:18,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:18,106 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 8 treesize of output 7 [2018-10-04 12:14:18,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:18,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:18,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:18,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:18,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:18,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:18,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:18,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:18,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-04 12:14:18,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 12:14:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 12:14:18,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 12:14:18,896 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2018-10-04 12:14:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:19,876 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-04 12:14:19,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:14:19,876 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2018-10-04 12:14:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:19,877 INFO L225 Difference]: With dead ends: 44 [2018-10-04 12:14:19,877 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:14:19,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 12:14:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:14:19,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-04 12:14:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 12:14:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 12:14:19,882 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-10-04 12:14:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:19,883 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 12:14:19,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 12:14:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 12:14:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 12:14:19,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:19,883 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-10-04 12:14:19,884 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:19,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:19,884 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-10-04 12:14:19,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:19,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:19,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:20,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:20,874 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:20,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:20,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:20,905 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 8 treesize of output 7 [2018-10-04 12:14:20,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:20,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:20,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:21,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:21,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:21,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:21,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:21,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:21,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-04 12:14:21,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 12:14:21,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 12:14:21,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1869, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 12:14:21,960 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2018-10-04 12:14:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:22,680 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 12:14:22,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:14:22,680 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2018-10-04 12:14:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:22,681 INFO L225 Difference]: With dead ends: 46 [2018-10-04 12:14:22,681 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:14:22,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=111, Invalid=1869, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 12:14:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:14:22,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-04 12:14:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 12:14:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-04 12:14:22,687 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-10-04 12:14:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:22,687 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-04 12:14:22,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 12:14:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-04 12:14:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 12:14:22,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:22,688 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-10-04 12:14:22,689 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:22,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:22,689 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-10-04 12:14:22,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:22,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:22,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:22,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:22,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:23,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:23,536 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:23,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:14:23,558 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:14:23,558 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:23,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:23,566 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 8 treesize of output 7 [2018-10-04 12:14:23,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:23,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:23,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:24,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:24,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:24,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:24,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:24,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:24,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-04 12:14:24,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 12:14:24,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 12:14:24,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 12:14:24,716 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2018-10-04 12:14:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:26,053 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-04 12:14:26,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:14:26,053 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2018-10-04 12:14:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:26,054 INFO L225 Difference]: With dead ends: 48 [2018-10-04 12:14:26,054 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:14:26,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 12:14:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:14:26,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-04 12:14:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 12:14:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-04 12:14:26,062 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-10-04 12:14:26,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:26,062 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-04 12:14:26,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 12:14:26,062 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-04 12:14:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 12:14:26,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:26,063 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-10-04 12:14:26,063 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:26,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:26,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-10-04 12:14:26,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:26,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:26,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:26,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:26,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:26,281 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:14:27,043 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-10-04 12:14:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:27,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:27,226 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:27,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:14:27,263 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 12:14:27,263 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:27,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:27,276 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 8 treesize of output 7 [2018-10-04 12:14:27,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:27,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:27,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:28,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:28,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:28,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:28,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:28,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:28,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-04 12:14:28,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 12:14:28,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 12:14:28,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=2231, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 12:14:28,470 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2018-10-04 12:14:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:29,693 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-04 12:14:29,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:14:29,694 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2018-10-04 12:14:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:29,695 INFO L225 Difference]: With dead ends: 50 [2018-10-04 12:14:29,695 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:14:29,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=121, Invalid=2231, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 12:14:29,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:14:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-04 12:14:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-04 12:14:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-04 12:14:29,701 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-10-04 12:14:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:29,701 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-04 12:14:29,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 12:14:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-04 12:14:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-04 12:14:29,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:29,702 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-10-04 12:14:29,702 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:29,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:29,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-10-04 12:14:29,703 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:29,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:29,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:29,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:29,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:29,978 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:14:30,227 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:14:30,506 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:14:30,811 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:14:31,112 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:14:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:31,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:31,805 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:14:31,828 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:14:31,828 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:31,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:31,832 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 8 treesize of output 7 [2018-10-04 12:14:31,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:31,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:31,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:33,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:33,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:33,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:33,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:33,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:33,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-04 12:14:33,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 12:14:33,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 12:14:33,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2424, Unknown=0, NotChecked=0, Total=2550 [2018-10-04 12:14:33,590 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2018-10-04 12:14:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:35,070 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-04 12:14:35,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:14:35,070 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2018-10-04 12:14:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:35,071 INFO L225 Difference]: With dead ends: 52 [2018-10-04 12:14:35,071 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:14:35,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=126, Invalid=2424, Unknown=0, NotChecked=0, Total=2550 [2018-10-04 12:14:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:14:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-04 12:14:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 12:14:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-04 12:14:35,077 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-10-04 12:14:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:35,077 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-04 12:14:35,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 12:14:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-04 12:14:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-04 12:14:35,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:35,078 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-10-04 12:14:35,079 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:35,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:35,079 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-10-04 12:14:35,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:35,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:35,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:35,285 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-04 12:14:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:36,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:36,218 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:36,228 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:14:36,251 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 12:14:36,251 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:36,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:36,255 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 8 treesize of output 7 [2018-10-04 12:14:36,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:36,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:36,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:37,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:37,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:37,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:37,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:37,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:37,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-04 12:14:37,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 12:14:37,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 12:14:37,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2625, Unknown=0, NotChecked=0, Total=2756 [2018-10-04 12:14:37,265 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2018-10-04 12:14:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:38,791 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-04 12:14:38,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:14:38,791 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2018-10-04 12:14:38,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:38,792 INFO L225 Difference]: With dead ends: 54 [2018-10-04 12:14:38,792 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:14:38,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=131, Invalid=2625, Unknown=0, NotChecked=0, Total=2756 [2018-10-04 12:14:38,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:14:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-10-04 12:14:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 12:14:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-04 12:14:38,798 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-10-04 12:14:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:38,799 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-04 12:14:38,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 12:14:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-04 12:14:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 12:14:38,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:38,800 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-10-04 12:14:38,800 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:38,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:38,800 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-10-04 12:14:38,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:38,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:38,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:38,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:38,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:39,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:39,792 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:39,799 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:14:39,832 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 12:14:39,832 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:39,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:39,840 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 8 treesize of output 7 [2018-10-04 12:14:39,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:39,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:39,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:41,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:41,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:41,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:41,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:41,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:41,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-04 12:14:41,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 12:14:41,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 12:14:41,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2834, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 12:14:41,223 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2018-10-04 12:14:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:42,427 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-04 12:14:42,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:14:42,428 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2018-10-04 12:14:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:42,428 INFO L225 Difference]: With dead ends: 56 [2018-10-04 12:14:42,428 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:14:42,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=136, Invalid=2834, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 12:14:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:14:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-10-04 12:14:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-04 12:14:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-04 12:14:42,433 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-10-04 12:14:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:42,433 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-04 12:14:42,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 12:14:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-04 12:14:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 12:14:42,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:42,434 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-10-04 12:14:42,435 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:42,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:42,435 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-10-04 12:14:42,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:42,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:42,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:42,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:42,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:43,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:43,515 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:43,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:43,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:43,543 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 8 treesize of output 7 [2018-10-04 12:14:43,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:43,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:43,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:44,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:44,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:44,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:44,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:44,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:44,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-04 12:14:44,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 12:14:44,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 12:14:44,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=3051, Unknown=0, NotChecked=0, Total=3192 [2018-10-04 12:14:44,714 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2018-10-04 12:14:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:45,972 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-04 12:14:45,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:14:45,972 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2018-10-04 12:14:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:45,973 INFO L225 Difference]: With dead ends: 58 [2018-10-04 12:14:45,973 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:14:45,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=141, Invalid=3051, Unknown=0, NotChecked=0, Total=3192 [2018-10-04 12:14:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:14:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-10-04 12:14:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-04 12:14:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-04 12:14:45,981 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-10-04 12:14:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:45,981 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-04 12:14:45,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 12:14:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-04 12:14:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-04 12:14:45,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:45,982 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-10-04 12:14:45,982 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:45,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:45,982 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-10-04 12:14:45,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:45,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:45,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:45,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:45,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:46,257 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:14:46,508 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:14:46,799 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:14:47,032 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:14:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:47,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:47,911 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:47,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:14:47,936 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:14:47,937 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:47,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:47,945 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 8 treesize of output 7 [2018-10-04 12:14:47,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:47,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:47,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:49,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:49,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:49,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:49,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:49,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:49,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-04 12:14:49,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 12:14:49,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 12:14:49,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=3276, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 12:14:49,166 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2018-10-04 12:14:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:50,417 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-04 12:14:50,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:14:50,418 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2018-10-04 12:14:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:50,418 INFO L225 Difference]: With dead ends: 60 [2018-10-04 12:14:50,419 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:14:50,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=146, Invalid=3276, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 12:14:50,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:14:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-10-04 12:14:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-04 12:14:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-04 12:14:50,423 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-10-04 12:14:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:50,423 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-04 12:14:50,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 12:14:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-04 12:14:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 12:14:50,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:50,423 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-10-04 12:14:50,424 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:50,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:50,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-10-04 12:14:50,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:50,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:50,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:50,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:50,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:51,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:51,715 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:51,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:14:51,759 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-04 12:14:51,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:51,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:51,766 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 8 treesize of output 7 [2018-10-04 12:14:51,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:51,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:51,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:52,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:52,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:52,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:52,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:53,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:53,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-04 12:14:53,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 12:14:53,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 12:14:53,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=3509, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 12:14:53,009 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2018-10-04 12:14:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:54,414 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-04 12:14:54,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:14:54,414 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2018-10-04 12:14:54,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:54,415 INFO L225 Difference]: With dead ends: 62 [2018-10-04 12:14:54,416 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 12:14:54,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=151, Invalid=3509, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 12:14:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 12:14:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-04 12:14:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-04 12:14:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-04 12:14:54,420 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-10-04 12:14:54,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:54,420 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-04 12:14:54,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 12:14:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-04 12:14:54,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-04 12:14:54,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:54,421 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-10-04 12:14:54,421 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:54,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:54,421 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-10-04 12:14:54,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:54,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:54,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:54,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:54,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:54,681 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:14:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:55,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:55,679 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:55,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:14:55,707 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:14:55,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:55,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:55,711 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 8 treesize of output 7 [2018-10-04 12:14:55,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:55,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:55,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:14:57,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:14:57,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:14:57,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:14:57,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:14:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:57,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:57,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-04 12:14:57,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 12:14:57,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 12:14:57,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=3750, Unknown=0, NotChecked=0, Total=3906 [2018-10-04 12:14:57,370 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2018-10-04 12:14:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:59,138 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-04 12:14:59,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:14:59,139 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2018-10-04 12:14:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:59,140 INFO L225 Difference]: With dead ends: 64 [2018-10-04 12:14:59,140 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 12:14:59,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=156, Invalid=3750, Unknown=0, NotChecked=0, Total=3906 [2018-10-04 12:14:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 12:14:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-10-04 12:14:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-04 12:14:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-04 12:14:59,145 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-10-04 12:14:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:59,145 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-04 12:14:59,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 12:14:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-04 12:14:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-04 12:14:59,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:59,146 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-10-04 12:14:59,146 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:59,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-10-04 12:14:59,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:59,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:59,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:59,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:59,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:59,397 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:14:59,614 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-04 12:15:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:00,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:00,642 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:00,648 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:15:00,693 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-04 12:15:00,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:00,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:00,698 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 8 treesize of output 7 [2018-10-04 12:15:00,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:00,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:00,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:15:02,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:15:02,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:02,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:02,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:15:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:02,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:02,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-04 12:15:02,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 12:15:02,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 12:15:02,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=3999, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 12:15:02,391 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2018-10-04 12:15:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:04,699 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-04 12:15:04,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:15:04,700 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2018-10-04 12:15:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:04,701 INFO L225 Difference]: With dead ends: 66 [2018-10-04 12:15:04,701 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 12:15:04,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=161, Invalid=3999, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 12:15:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 12:15:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-10-04 12:15:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 12:15:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-04 12:15:04,706 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-10-04 12:15:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:04,706 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-04 12:15:04,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 12:15:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-04 12:15:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 12:15:04,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:04,707 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-10-04 12:15:04,707 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:04,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-10-04 12:15:04,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:04,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:04,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:04,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:15:04,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:04,899 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:15:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:05,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:05,978 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:05,987 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:15:06,029 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 12:15:06,030 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:06,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:06,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 8 treesize of output 7 [2018-10-04 12:15:06,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:06,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:06,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:15:07,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:15:07,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:07,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:07,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:15:07,814 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:07,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:07,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-04 12:15:07,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 12:15:07,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 12:15:07,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=4256, Unknown=0, NotChecked=0, Total=4422 [2018-10-04 12:15:07,836 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2018-10-04 12:15:09,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:09,572 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-04 12:15:09,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:15:09,572 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2018-10-04 12:15:09,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:09,573 INFO L225 Difference]: With dead ends: 68 [2018-10-04 12:15:09,573 INFO L226 Difference]: Without dead ends: 67 [2018-10-04 12:15:09,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=166, Invalid=4256, Unknown=0, NotChecked=0, Total=4422 [2018-10-04 12:15:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-04 12:15:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-04 12:15:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-04 12:15:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-04 12:15:09,578 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-10-04 12:15:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:09,579 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-04 12:15:09,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 12:15:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-04 12:15:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 12:15:09,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:09,580 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-10-04 12:15:09,580 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:09,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-10-04 12:15:09,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:09,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:09,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:09,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:15:09,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:10,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:10,856 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:10,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:10,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:10,888 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 8 treesize of output 7 [2018-10-04 12:15:10,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:10,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:10,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:15:12,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:15:12,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:12,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:12,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:15:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:12,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:12,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-04 12:15:12,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 12:15:12,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 12:15:12,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=4521, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 12:15:12,790 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2018-10-04 12:15:15,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:15,346 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-04 12:15:15,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:15:15,347 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2018-10-04 12:15:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:15,348 INFO L225 Difference]: With dead ends: 70 [2018-10-04 12:15:15,348 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 12:15:15,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=171, Invalid=4521, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 12:15:15,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 12:15:15,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-10-04 12:15:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 12:15:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-04 12:15:15,354 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-10-04 12:15:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:15,354 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-04 12:15:15,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 12:15:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-04 12:15:15,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 12:15:15,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:15,355 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-10-04 12:15:15,355 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:15,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:15,355 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-10-04 12:15:15,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:15,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:15,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:15,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:15,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:16,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:16,888 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:16,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:15:16,916 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:15:16,916 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:16,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:16,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-04 12:15:16,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:16,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:16,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:15:19,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:15:19,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:19,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:19,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:15:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:19,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:19,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-04 12:15:19,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 12:15:19,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 12:15:19,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=4794, Unknown=0, NotChecked=0, Total=4970 [2018-10-04 12:15:19,899 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2018-10-04 12:15:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:22,254 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-04 12:15:22,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:15:22,254 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2018-10-04 12:15:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:22,255 INFO L225 Difference]: With dead ends: 72 [2018-10-04 12:15:22,255 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 12:15:22,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=176, Invalid=4794, Unknown=0, NotChecked=0, Total=4970 [2018-10-04 12:15:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 12:15:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-10-04 12:15:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-04 12:15:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-04 12:15:22,260 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-10-04 12:15:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:22,260 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-04 12:15:22,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 12:15:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-04 12:15:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-04 12:15:22,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:22,261 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-10-04 12:15:22,261 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:22,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:22,262 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-10-04 12:15:22,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:22,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:22,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:22,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:15:22,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:22,468 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:15:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:23,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:23,674 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:23,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:15:23,724 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-04 12:15:23,725 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:23,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:23,736 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 8 treesize of output 7 [2018-10-04 12:15:23,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:23,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:23,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:15:25,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:15:25,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:25,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:25,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:15:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:25,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:25,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-04 12:15:25,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 12:15:25,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 12:15:25,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=5075, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 12:15:25,546 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2018-10-04 12:15:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:27,749 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-04 12:15:27,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 12:15:27,750 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2018-10-04 12:15:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:27,751 INFO L225 Difference]: With dead ends: 74 [2018-10-04 12:15:27,751 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 12:15:27,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=181, Invalid=5075, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 12:15:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 12:15:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-10-04 12:15:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-04 12:15:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-04 12:15:27,755 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-10-04 12:15:27,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:27,756 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-04 12:15:27,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 12:15:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-04 12:15:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 12:15:27,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:27,756 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-10-04 12:15:27,757 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:27,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:27,757 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-10-04 12:15:27,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:27,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:27,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:27,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:15:27,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:29,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:29,147 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:29,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:15:29,176 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:15:29,177 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:29,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:29,185 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 8 treesize of output 7 [2018-10-04 12:15:29,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:29,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:29,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:15:30,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:15:30,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:30,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:30,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:15:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:31,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:31,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-04 12:15:31,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 12:15:31,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 12:15:31,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=5364, Unknown=0, NotChecked=0, Total=5550 [2018-10-04 12:15:31,074 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2018-10-04 12:15:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:33,662 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-04 12:15:33,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:15:33,663 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2018-10-04 12:15:33,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:33,664 INFO L225 Difference]: With dead ends: 76 [2018-10-04 12:15:33,664 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 12:15:33,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=186, Invalid=5364, Unknown=0, NotChecked=0, Total=5550 [2018-10-04 12:15:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 12:15:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-10-04 12:15:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 12:15:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-04 12:15:33,670 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-10-04 12:15:33,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:33,670 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-04 12:15:33,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 12:15:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-04 12:15:33,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 12:15:33,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:33,671 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-10-04 12:15:33,671 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:33,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:33,671 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-10-04 12:15:33,671 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:33,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:33,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:33,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:15:33,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:33,948 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:15:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:35,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:35,338 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:35,345 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:15:35,660 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-04 12:15:35,661 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:35,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:35,668 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 8 treesize of output 7 [2018-10-04 12:15:35,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:35,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:35,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:15:37,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:15:37,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:37,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:37,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:15:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:37,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:37,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-04 12:15:37,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 12:15:37,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 12:15:37,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=5661, Unknown=0, NotChecked=0, Total=5852 [2018-10-04 12:15:37,955 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2018-10-04 12:15:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:40,636 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-04 12:15:40,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 12:15:40,636 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2018-10-04 12:15:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:40,637 INFO L225 Difference]: With dead ends: 78 [2018-10-04 12:15:40,637 INFO L226 Difference]: Without dead ends: 77 [2018-10-04 12:15:40,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=191, Invalid=5661, Unknown=0, NotChecked=0, Total=5852 [2018-10-04 12:15:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-04 12:15:40,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-10-04 12:15:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 12:15:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-04 12:15:40,642 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-10-04 12:15:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:40,642 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-04 12:15:40,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 12:15:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-04 12:15:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-04 12:15:40,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:40,642 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-10-04 12:15:40,643 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:40,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:40,643 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-10-04 12:15:40,643 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:40,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:40,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:40,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:15:40,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:40,875 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:15:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:42,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:42,493 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:42,502 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:15:42,566 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 12:15:42,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:42,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:42,578 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 8 treesize of output 7 [2018-10-04 12:15:42,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:42,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:42,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:15:44,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:15:44,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:44,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:44,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:15:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:44,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:44,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-04 12:15:44,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 12:15:44,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 12:15:44,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=5966, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 12:15:44,709 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2018-10-04 12:15:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:47,216 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-04 12:15:47,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 12:15:47,217 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2018-10-04 12:15:47,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:47,218 INFO L225 Difference]: With dead ends: 80 [2018-10-04 12:15:47,218 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 12:15:47,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=196, Invalid=5966, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 12:15:47,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 12:15:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-10-04 12:15:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-04 12:15:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-04 12:15:47,223 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-10-04 12:15:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:47,223 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-04 12:15:47,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 12:15:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-04 12:15:47,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 12:15:47,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:47,224 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-10-04 12:15:47,225 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:47,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:47,225 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-10-04 12:15:47,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:47,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:47,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:47,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:15:47,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:48,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:48,958 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:48,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:48,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:49,012 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 8 treesize of output 7 [2018-10-04 12:15:49,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:49,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:49,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:15:51,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:15:51,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:51,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:51,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:15:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:51,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:51,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-04 12:15:51,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 12:15:51,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 12:15:51,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=6279, Unknown=0, NotChecked=0, Total=6480 [2018-10-04 12:15:51,258 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2018-10-04 12:15:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:54,234 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-04 12:15:54,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 12:15:54,234 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2018-10-04 12:15:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:54,235 INFO L225 Difference]: With dead ends: 82 [2018-10-04 12:15:54,235 INFO L226 Difference]: Without dead ends: 81 [2018-10-04 12:15:54,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=201, Invalid=6279, Unknown=0, NotChecked=0, Total=6480 [2018-10-04 12:15:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-04 12:15:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-10-04 12:15:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 12:15:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-04 12:15:54,240 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-10-04 12:15:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:54,241 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-04 12:15:54,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 12:15:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-04 12:15:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-04 12:15:54,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:54,241 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-10-04 12:15:54,241 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:54,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-10-04 12:15:54,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:54,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:54,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:54,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:54,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:54,488 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:15:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:56,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:56,045 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:56,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:15:56,077 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:15:56,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:56,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:56,099 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 8 treesize of output 7 [2018-10-04 12:15:56,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:56,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:56,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:15:58,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:15:58,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:15:58,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:15:58,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:15:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:58,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:58,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-04 12:15:58,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 12:15:58,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 12:15:58,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=6600, Unknown=0, NotChecked=0, Total=6806 [2018-10-04 12:15:58,682 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2018-10-04 12:16:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:02,056 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-04 12:16:02,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:16:02,056 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2018-10-04 12:16:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:02,057 INFO L225 Difference]: With dead ends: 84 [2018-10-04 12:16:02,057 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 12:16:02,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=206, Invalid=6600, Unknown=0, NotChecked=0, Total=6806 [2018-10-04 12:16:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 12:16:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-10-04 12:16:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-04 12:16:02,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-04 12:16:02,062 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-10-04 12:16:02,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:02,062 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-04 12:16:02,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-04 12:16:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-04 12:16:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-04 12:16:02,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:02,063 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-10-04 12:16:02,063 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:02,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:02,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-10-04 12:16:02,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:02,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:02,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:02,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:02,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:02,308 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:16:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:04,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:04,198 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:04,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:16:04,261 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-04 12:16:04,262 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:04,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:04,270 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 8 treesize of output 7 [2018-10-04 12:16:04,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:16:04,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:16:04,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:16:06,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:16:06,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:16:06,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:16:06,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:16:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:06,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:06,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-04 12:16:06,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-04 12:16:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-04 12:16:06,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=6929, Unknown=0, NotChecked=0, Total=7140 [2018-10-04 12:16:06,774 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2018-10-04 12:16:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:10,290 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-04 12:16:10,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 12:16:10,291 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2018-10-04 12:16:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:10,292 INFO L225 Difference]: With dead ends: 86 [2018-10-04 12:16:10,292 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 12:16:10,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=211, Invalid=6929, Unknown=0, NotChecked=0, Total=7140 [2018-10-04 12:16:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 12:16:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-10-04 12:16:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-04 12:16:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-04 12:16:10,297 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-10-04 12:16:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:10,298 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-04 12:16:10,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-04 12:16:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-04 12:16:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-04 12:16:10,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:10,298 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-10-04 12:16:10,299 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:10,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:10,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-10-04 12:16:10,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:10,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:10,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:10,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:10,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:10,474 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:16:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:12,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:12,186 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:12,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:16:12,223 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:16:12,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:12,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:12,227 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 8 treesize of output 7 [2018-10-04 12:16:12,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:16:12,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:16:12,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:16:14,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:16:14,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:16:14,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:16:14,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:16:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:14,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:14,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-04 12:16:14,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-04 12:16:14,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-04 12:16:14,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=7266, Unknown=0, NotChecked=0, Total=7482 [2018-10-04 12:16:14,965 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2018-10-04 12:16:18,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:18,685 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-04 12:16:18,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:16:18,686 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2018-10-04 12:16:18,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:18,687 INFO L225 Difference]: With dead ends: 88 [2018-10-04 12:16:18,687 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 12:16:18,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=216, Invalid=7266, Unknown=0, NotChecked=0, Total=7482 [2018-10-04 12:16:18,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 12:16:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-10-04 12:16:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-04 12:16:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-04 12:16:18,693 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-10-04 12:16:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:18,693 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-04 12:16:18,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-04 12:16:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-04 12:16:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-04 12:16:18,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:18,694 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-10-04 12:16:18,694 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:18,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:18,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-10-04 12:16:18,695 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:18,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:18,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:18,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:18,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:18,939 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:16:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:20,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:20,692 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:20,701 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:16:20,748 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-04 12:16:20,748 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:20,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:20,753 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 8 treesize of output 7 [2018-10-04 12:16:20,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:16:20,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:16:20,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:16:23,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:16:23,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:16:23,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:16:23,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:16:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:23,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:23,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-04 12:16:23,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-04 12:16:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-04 12:16:23,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=7611, Unknown=0, NotChecked=0, Total=7832 [2018-10-04 12:16:23,605 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2018-10-04 12:16:26,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:26,671 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-04 12:16:26,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 12:16:26,672 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2018-10-04 12:16:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:26,673 INFO L225 Difference]: With dead ends: 90 [2018-10-04 12:16:26,673 INFO L226 Difference]: Without dead ends: 89 [2018-10-04 12:16:26,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=221, Invalid=7611, Unknown=0, NotChecked=0, Total=7832 [2018-10-04 12:16:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-04 12:16:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-10-04 12:16:26,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-04 12:16:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-04 12:16:26,678 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-10-04 12:16:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:26,678 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-04 12:16:26,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-04 12:16:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-04 12:16:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 12:16:26,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:26,679 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-10-04 12:16:26,679 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:26,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:26,679 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-10-04 12:16:26,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:26,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:26,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:26,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:26,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:26,939 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:16:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:29,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:29,095 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:29,103 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:16:29,167 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-04 12:16:29,167 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:29,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:29,172 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 8 treesize of output 7 [2018-10-04 12:16:29,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:16:29,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:16:29,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:16:31,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:16:31,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:16:31,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:16:31,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:16:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:31,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:31,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-10-04 12:16:31,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-04 12:16:31,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-04 12:16:31,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7964, Unknown=0, NotChecked=0, Total=8190 [2018-10-04 12:16:31,956 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2018-10-04 12:16:36,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:36,598 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-04 12:16:36,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 12:16:36,598 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2018-10-04 12:16:36,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:36,599 INFO L225 Difference]: With dead ends: 92 [2018-10-04 12:16:36,599 INFO L226 Difference]: Without dead ends: 91 [2018-10-04 12:16:36,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=226, Invalid=7964, Unknown=0, NotChecked=0, Total=8190 [2018-10-04 12:16:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-04 12:16:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-10-04 12:16:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-04 12:16:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-04 12:16:36,604 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-10-04 12:16:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:36,605 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-04 12:16:36,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-04 12:16:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-04 12:16:36,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-04 12:16:36,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:36,605 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-10-04 12:16:36,606 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:36,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:36,606 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-10-04 12:16:36,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:36,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:36,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:36,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:36,879 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:16:37,143 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:16:37,419 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:16:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:39,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:39,646 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:39,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:39,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:39,687 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 8 treesize of output 7 [2018-10-04 12:16:39,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:16:39,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:16:39,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:16:42,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:16:42,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:16:42,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:16:42,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:16:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:42,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:42,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-10-04 12:16:42,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-04 12:16:42,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-04 12:16:42,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=8325, Unknown=0, NotChecked=0, Total=8556 [2018-10-04 12:16:42,571 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2018-10-04 12:16:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:47,486 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-04 12:16:47,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:16:47,486 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2018-10-04 12:16:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:47,488 INFO L225 Difference]: With dead ends: 94 [2018-10-04 12:16:47,488 INFO L226 Difference]: Without dead ends: 93 [2018-10-04 12:16:47,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=231, Invalid=8325, Unknown=0, NotChecked=0, Total=8556 [2018-10-04 12:16:47,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-04 12:16:47,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-10-04 12:16:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-04 12:16:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-04 12:16:47,493 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-10-04 12:16:47,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:47,493 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-04 12:16:47,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-04 12:16:47,493 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-04 12:16:47,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-04 12:16:47,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:47,494 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-10-04 12:16:47,494 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:47,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:47,494 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-10-04 12:16:47,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:47,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:47,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:47,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:47,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:47,706 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:16:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:49,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:49,913 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:49,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:16:49,952 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:16:49,953 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:49,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:49,958 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 8 treesize of output 7 [2018-10-04 12:16:49,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:16:49,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:16:49,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:16:52,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:16:52,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:16:52,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:16:52,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:16:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:52,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:52,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-10-04 12:16:52,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-04 12:16:52,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-04 12:16:52,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=8694, Unknown=0, NotChecked=0, Total=8930 [2018-10-04 12:16:52,977 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2018-10-04 12:16:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:57,924 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-04 12:16:57,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 12:16:57,924 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2018-10-04 12:16:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:57,925 INFO L225 Difference]: With dead ends: 96 [2018-10-04 12:16:57,925 INFO L226 Difference]: Without dead ends: 95 [2018-10-04 12:16:57,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=236, Invalid=8694, Unknown=0, NotChecked=0, Total=8930 [2018-10-04 12:16:57,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-04 12:16:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-10-04 12:16:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-04 12:16:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-04 12:16:57,930 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-10-04 12:16:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:57,931 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-04 12:16:57,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-04 12:16:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-04 12:16:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-04 12:16:57,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:57,931 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-10-04 12:16:57,931 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:57,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:57,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-10-04 12:16:57,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:57,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:57,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:57,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:57,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:58,120 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:17:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:00,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:00,335 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:00,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:17:00,415 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-04 12:17:00,415 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:17:00,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:00,424 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 8 treesize of output 7 [2018-10-04 12:17:00,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:17:00,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:17:00,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:17:03,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:17:03,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:17:03,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:17:03,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:17:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:03,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:03,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-10-04 12:17:03,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-04 12:17:03,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-04 12:17:03,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=9071, Unknown=0, NotChecked=0, Total=9312 [2018-10-04 12:17:03,589 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2018-10-04 12:17:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:08,984 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-04 12:17:08,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 12:17:08,984 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2018-10-04 12:17:08,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:08,985 INFO L225 Difference]: With dead ends: 98 [2018-10-04 12:17:08,986 INFO L226 Difference]: Without dead ends: 97 [2018-10-04 12:17:08,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=241, Invalid=9071, Unknown=0, NotChecked=0, Total=9312 [2018-10-04 12:17:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-04 12:17:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-10-04 12:17:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-04 12:17:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-04 12:17:08,990 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-10-04 12:17:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:08,990 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-04 12:17:08,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-04 12:17:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-04 12:17:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-04 12:17:08,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:08,991 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-10-04 12:17:08,991 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:08,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:08,991 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-10-04 12:17:08,991 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:08,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:08,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:08,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:17:08,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:09,254 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:17:09,511 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-04 12:17:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:11,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:11,644 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:11,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:17:11,682 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:17:11,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:17:11,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:11,687 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 8 treesize of output 7 [2018-10-04 12:17:11,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:17:11,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:17:11,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:17:15,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:17:15,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:17:15,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:17:15,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:17:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:15,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:15,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-10-04 12:17:15,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-04 12:17:15,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-04 12:17:15,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=9456, Unknown=0, NotChecked=0, Total=9702 [2018-10-04 12:17:15,209 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2018-10-04 12:17:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:19,688 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-04 12:17:19,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 12:17:19,689 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2018-10-04 12:17:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:19,690 INFO L225 Difference]: With dead ends: 100 [2018-10-04 12:17:19,691 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 12:17:19,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=246, Invalid=9456, Unknown=0, NotChecked=0, Total=9702 [2018-10-04 12:17:19,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 12:17:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-10-04 12:17:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-04 12:17:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-04 12:17:19,696 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-10-04 12:17:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:19,696 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-04 12:17:19,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-04 12:17:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-04 12:17:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 12:17:19,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:19,697 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-10-04 12:17:19,697 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:19,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:19,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-10-04 12:17:19,698 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:19,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:19,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:19,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:17:19,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:21,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:21,901 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:21,909 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:17:21,963 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-04 12:17:21,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:17:21,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:21,991 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 8 treesize of output 7 [2018-10-04 12:17:21,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:17:22,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:17:22,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:17:26,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:17:26,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:17:26,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:17:26,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:17:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:26,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:26,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-10-04 12:17:26,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-04 12:17:26,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-04 12:17:26,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=9849, Unknown=0, NotChecked=0, Total=10100 [2018-10-04 12:17:26,393 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2018-10-04 12:17:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:30,363 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-04 12:17:30,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 12:17:30,364 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2018-10-04 12:17:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:30,365 INFO L225 Difference]: With dead ends: 102 [2018-10-04 12:17:30,365 INFO L226 Difference]: Without dead ends: 101 [2018-10-04 12:17:30,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=251, Invalid=9849, Unknown=0, NotChecked=0, Total=10100 [2018-10-04 12:17:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-04 12:17:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-10-04 12:17:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 12:17:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-04 12:17:30,370 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-10-04 12:17:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:30,370 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-04 12:17:30,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-04 12:17:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-04 12:17:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 12:17:30,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:30,371 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-10-04 12:17:30,372 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:30,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:30,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-10-04 12:17:30,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:30,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:30,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:30,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:17:30,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:30,620 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:17:30,832 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-04 12:17:31,093 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:17:31,347 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:17:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:33,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:33,586 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:33,594 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:17:33,668 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-04 12:17:33,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:17:33,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:33,673 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 8 treesize of output 7 [2018-10-04 12:17:33,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:17:33,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:17:33,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:17:37,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:17:37,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:17:37,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:17:37,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:17:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:37,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:37,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-10-04 12:17:37,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-04 12:17:37,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-04 12:17:37,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=10250, Unknown=0, NotChecked=0, Total=10506 [2018-10-04 12:17:37,507 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2018-10-04 12:17:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:43,574 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-04 12:17:43,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 12:17:43,574 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2018-10-04 12:17:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:43,575 INFO L225 Difference]: With dead ends: 104 [2018-10-04 12:17:43,575 INFO L226 Difference]: Without dead ends: 103 [2018-10-04 12:17:43,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=256, Invalid=10250, Unknown=0, NotChecked=0, Total=10506 [2018-10-04 12:17:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-04 12:17:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-10-04 12:17:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-04 12:17:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-04 12:17:43,583 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-10-04 12:17:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:43,583 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-04 12:17:43,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-04 12:17:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-04 12:17:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-04 12:17:43,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:43,584 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-10-04 12:17:43,584 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:43,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:43,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-10-04 12:17:43,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:43,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:43,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:43,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:17:43,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:46,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:46,197 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:46,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:46,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:46,243 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 8 treesize of output 7 [2018-10-04 12:17:46,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:17:46,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:17:46,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-04 12:17:49,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-04 12:17:49,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:17:49,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:17:49,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-10-04 12:17:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:49,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:49,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-10-04 12:17:49,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-04 12:17:49,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-04 12:17:49,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=10659, Unknown=0, NotChecked=0, Total=10920 [2018-10-04 12:17:49,919 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. Received shutdown request... [2018-10-04 12:17:54,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 12:17:54,121 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:17:54,200 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:17:54,200 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:17:54 BoogieIcfgContainer [2018-10-04 12:17:54,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:17:54,201 INFO L168 Benchmark]: Toolchain (without parser) took 245872.93 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 607.1 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -661.6 MB). Peak memory consumption was 182.9 MB. Max. memory is 7.1 GB. [2018-10-04 12:17:54,201 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:17:54,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:17:54,201 INFO L168 Benchmark]: Boogie Preprocessor took 22.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:17:54,202 INFO L168 Benchmark]: RCFGBuilder took 267.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:17:54,202 INFO L168 Benchmark]: TraceAbstraction took 245539.82 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 607.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -682.7 MB). Peak memory consumption was 161.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:17:54,203 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 267.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245539.82 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 607.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -682.7 MB). Peak memory consumption was 161.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (102states) and FLOYD_HOARE automaton (currently 44 states, 105 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 245.4s OverallTime, 50 OverallIterations, 50 TraceHistogramMax, 95.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 101 SDtfs, 126 SDslu, 2 SDs, 0 SdLazy, 134745 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 80.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3922 GetRequests, 1176 SyntacticMatches, 49 SemanticMatches, 2697 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24696 ImplicationChecksByTransitivity, 140.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 49 MinimizatonAttempts, 49 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 144.7s InterpolantComputationTime, 5197 NumberOfCodeBlocks, 5197 NumberOfCodeBlocksAsserted, 731 NumberOfCheckSat, 5098 ConstructedInterpolants, 0 QuantifiedInterpolants, 5742568 SizeOfPredicates, 49 NumberOfNonLiveVariables, 5390 ConjunctsInSsa, 2793 ConjunctsInUnsatCore, 99 InterpolantComputations, 1 PerfectInterpolantSequences, 0/83300 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/divisibilityWithArray.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-17-54-211.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/divisibilityWithArray.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-17-54-211.csv Completed graceful shutdown