java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4eac566 [2018-09-23 19:50:54,216 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:50:54,218 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:50:54,231 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:50:54,231 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:50:54,232 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:50:54,233 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:50:54,235 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:50:54,237 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:50:54,238 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:50:54,239 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:50:54,239 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:50:54,240 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:50:54,241 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:50:54,242 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:50:54,243 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:50:54,244 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:50:54,246 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:50:54,248 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:50:54,250 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:50:54,251 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:50:54,252 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:50:54,254 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:50:54,255 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:50:54,255 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:50:54,256 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:50:54,257 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:50:54,258 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:50:54,259 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:50:54,260 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:50:54,260 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:50:54,261 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:50:54,261 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:50:54,261 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:50:54,262 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:50:54,263 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:50:54,263 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 19:50:54,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:50:54,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:50:54,279 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:50:54,279 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:50:54,280 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:50:54,280 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:50:54,280 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:50:54,281 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:50:54,281 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:50:54,281 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:50:54,281 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:50:54,281 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:50:54,281 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:50:54,282 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:50:54,282 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:50:54,282 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:50:54,282 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:50:54,282 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:50:54,283 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:50:54,283 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:50:54,283 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:50:54,283 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:50:54,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:50:54,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:50:54,284 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:50:54,284 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:50:54,284 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:50:54,284 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:50:54,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:50:54,285 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:50:54,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:50:54,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:50:54,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:50:54,346 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:50:54,348 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:50:54,348 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2018-09-23 19:50:54,349 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2018-09-23 19:50:54,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:50:54,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:50:54,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:50:54,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:50:54,413 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:50:54,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:54" (1/1) ... [2018-09-23 19:50:54,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:54" (1/1) ... [2018-09-23 19:50:54,456 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-23 19:50:54,456 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-23 19:50:54,456 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-23 19:50:54,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:50:54,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:50:54,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:50:54,474 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:50:54,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:54" (1/1) ... [2018-09-23 19:50:54,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:54" (1/1) ... [2018-09-23 19:50:54,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:54" (1/1) ... [2018-09-23 19:50:54,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:54" (1/1) ... [2018-09-23 19:50:54,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:54" (1/1) ... [2018-09-23 19:50:54,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:54" (1/1) ... [2018-09-23 19:50:54,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:54" (1/1) ... [2018-09-23 19:50:54,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:50:54,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:50:54,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:50:54,498 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:50:54,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:50:54,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-23 19:50:54,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-23 19:50:54,578 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-23 19:50:54,820 INFO L351 CfgBuilder]: Using library mode [2018-09-23 19:50:54,821 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:50:54 BoogieIcfgContainer [2018-09-23 19:50:54,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:50:54,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:50:54,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:50:54,849 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:50:54,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:50:54" (1/2) ... [2018-09-23 19:50:54,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1d15b6 and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:50:54, skipping insertion in model container [2018-09-23 19:50:54,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:50:54" (2/2) ... [2018-09-23 19:50:54,853 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2018-09-23 19:50:54,870 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:50:54,879 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 19:50:54,960 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:50:54,961 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:50:54,962 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:50:54,962 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:50:54,962 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:50:54,962 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:50:54,962 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:50:54,963 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:50:54,963 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:50:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-23 19:50:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-23 19:50:54,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:54,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-23 19:50:54,988 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:54,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:54,995 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-23 19:50:54,998 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:54,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:55,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:55,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:55,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:55,220 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:50:55,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-23 19:50:55,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:50:55,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:50:55,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:50:55,240 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-09-23 19:50:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:55,305 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-23 19:50:55,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:50:55,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-23 19:50:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:55,322 INFO L225 Difference]: With dead ends: 17 [2018-09-23 19:50:55,325 INFO L226 Difference]: Without dead ends: 10 [2018-09-23 19:50:55,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:50:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-23 19:50:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-09-23 19:50:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-23 19:50:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-23 19:50:55,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-09-23 19:50:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:55,367 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-23 19:50:55,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:50:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-23 19:50:55,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:50:55,368 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:55,368 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-23 19:50:55,368 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:55,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:55,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-09-23 19:50:55,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:55,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:55,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:55,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:55,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:55,451 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:55,451 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:55,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:55,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:55,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 6 treesize of output 5 [2018-09-23 19:50:55,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:55,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:55,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:55,710 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:55,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-09-23 19:50:55,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-23 19:50:55,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-23 19:50:55,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-23 19:50:55,713 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-23 19:50:55,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:55,813 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-23 19:50:55,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 19:50:55,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-23 19:50:55,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:55,814 INFO L225 Difference]: With dead ends: 15 [2018-09-23 19:50:55,815 INFO L226 Difference]: Without dead ends: 14 [2018-09-23 19:50:55,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-23 19:50:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-23 19:50:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-23 19:50:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-23 19:50:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-23 19:50:55,820 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-09-23 19:50:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:55,821 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-23 19:50:55,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-23 19:50:55,821 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-23 19:50:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:50:55,822 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:55,822 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-09-23 19:50:55,822 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:55,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-09-23 19:50:55,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:55,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:55,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:55,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:55,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:55,969 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:55,969 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) [2018-09-23 19:50:55,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:56,036 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:50:56,036 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:56,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:56,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:56,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:56,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:56,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:56,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:56,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-23 19:50:56,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:50:56,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:50:56,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:50:56,280 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-23 19:50:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:56,366 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-23 19:50:56,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:50:56,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:50:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:56,368 INFO L225 Difference]: With dead ends: 19 [2018-09-23 19:50:56,368 INFO L226 Difference]: Without dead ends: 18 [2018-09-23 19:50:56,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:50:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-23 19:50:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-23 19:50:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-23 19:50:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-23 19:50:56,377 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-09-23 19:50:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:56,378 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-23 19:50:56,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:50:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-23 19:50:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:50:56,379 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:56,379 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-09-23 19:50:56,380 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:56,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:56,380 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-09-23 19:50:56,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:56,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:56,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:56,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:56,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:56,547 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:56,547 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:56,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:50:56,621 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-23 19:50:56,622 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:56,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:56,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:56,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:56,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:56,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:56,871 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:56,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-23 19:50:56,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-23 19:50:56,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-23 19:50:56,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-23 19:50:56,874 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-23 19:50:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:56,940 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-23 19:50:56,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-23 19:50:56,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-23 19:50:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:56,943 INFO L225 Difference]: With dead ends: 23 [2018-09-23 19:50:56,943 INFO L226 Difference]: Without dead ends: 22 [2018-09-23 19:50:56,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-23 19:50:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-23 19:50:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-09-23 19:50:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-23 19:50:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-23 19:50:56,949 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-09-23 19:50:56,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:56,950 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-23 19:50:56,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-23 19:50:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-23 19:50:56,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-23 19:50:56,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:56,951 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-09-23 19:50:56,951 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:56,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:56,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-09-23 19:50:56,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:56,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:56,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:56,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:56,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:57,073 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:57,073 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:57,091 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:50:57,103 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:50:57,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:57,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:57,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:57,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:57,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:57,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:57,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:57,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-23 19:50:57,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-23 19:50:57,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-23 19:50:57,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-23 19:50:57,556 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-23 19:50:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:57,634 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-23 19:50:57,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-23 19:50:57,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-23 19:50:57,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:57,636 INFO L225 Difference]: With dead ends: 27 [2018-09-23 19:50:57,636 INFO L226 Difference]: Without dead ends: 26 [2018-09-23 19:50:57,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-23 19:50:57,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-23 19:50:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-23 19:50:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-23 19:50:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-23 19:50:57,643 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-09-23 19:50:57,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:57,643 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-23 19:50:57,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-23 19:50:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-23 19:50:57,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-23 19:50:57,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:57,645 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-09-23 19:50:57,645 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:57,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:57,645 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-09-23 19:50:57,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:57,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:57,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:57,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:57,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:57,941 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:57,941 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:57,955 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:50:57,970 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-23 19:50:57,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:57,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:57,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:57,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:57,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:57,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:58,134 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:58,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-23 19:50:58,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-23 19:50:58,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-23 19:50:58,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:50:58,136 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-23 19:50:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:58,192 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-23 19:50:58,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-23 19:50:58,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-23 19:50:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:58,198 INFO L225 Difference]: With dead ends: 31 [2018-09-23 19:50:58,198 INFO L226 Difference]: Without dead ends: 30 [2018-09-23 19:50:58,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:50:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-23 19:50:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-23 19:50:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-23 19:50:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-23 19:50:58,204 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-09-23 19:50:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:58,204 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-23 19:50:58,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-23 19:50:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-23 19:50:58,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-23 19:50:58,205 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:58,206 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-09-23 19:50:58,206 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:58,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:58,206 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-09-23 19:50:58,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:58,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:58,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:58,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:58,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:58,340 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:58,340 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:58,352 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:50:58,390 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-23 19:50:58,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:58,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:58,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:58,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:58,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:58,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:58,636 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:58,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-23 19:50:58,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 19:50:58,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 19:50:58,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:50:58,638 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-23 19:50:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:58,722 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-23 19:50:58,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 19:50:58,723 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-23 19:50:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:58,726 INFO L225 Difference]: With dead ends: 35 [2018-09-23 19:50:58,726 INFO L226 Difference]: Without dead ends: 34 [2018-09-23 19:50:58,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:50:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-23 19:50:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-23 19:50:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-23 19:50:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-23 19:50:58,733 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-09-23 19:50:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:58,733 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-23 19:50:58,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 19:50:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-23 19:50:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-23 19:50:58,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:58,735 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-09-23 19:50:58,735 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:58,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:58,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-09-23 19:50:58,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:58,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:58,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:58,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:50:58,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:58,888 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:58,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:58,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:58,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:58,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:58,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:58,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:58,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:59,151 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:59,151 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-23 19:50:59,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-23 19:50:59,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-23 19:50:59,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:50:59,153 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-23 19:50:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:50:59,373 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-23 19:50:59,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-23 19:50:59,374 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-23 19:50:59,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:50:59,376 INFO L225 Difference]: With dead ends: 39 [2018-09-23 19:50:59,376 INFO L226 Difference]: Without dead ends: 38 [2018-09-23 19:50:59,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:50:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-23 19:50:59,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-09-23 19:50:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-23 19:50:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-23 19:50:59,382 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-09-23 19:50:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:50:59,383 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-23 19:50:59,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-23 19:50:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-23 19:50:59,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-23 19:50:59,384 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:50:59,384 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-09-23 19:50:59,384 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:50:59,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:50:59,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-09-23 19:50:59,385 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:50:59,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:50:59,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:59,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:50:59,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:50:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:50:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:59,568 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:50:59,568 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:50:59,595 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:50:59,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:50:59,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:50:59,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:50:59,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:59,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:50:59,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:50:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:50:59,930 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:50:59,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-23 19:50:59,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-23 19:50:59,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-23 19:50:59,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-23 19:50:59,932 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-23 19:51:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:00,040 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-23 19:51:00,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:51:00,041 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-23 19:51:00,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:00,042 INFO L225 Difference]: With dead ends: 43 [2018-09-23 19:51:00,042 INFO L226 Difference]: Without dead ends: 42 [2018-09-23 19:51:00,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-23 19:51:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-23 19:51:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-23 19:51:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-23 19:51:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-23 19:51:00,049 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-09-23 19:51:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:00,050 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-23 19:51:00,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-23 19:51:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-23 19:51:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-23 19:51:00,051 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:00,051 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-09-23 19:51:00,052 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:00,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:00,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-09-23 19:51:00,052 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:00,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:00,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:00,234 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:00,234 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:00,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:00,285 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-23 19:51:00,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:00,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:00,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:00,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:00,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:00,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:00,661 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:00,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-23 19:51:00,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-23 19:51:00,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-23 19:51:00,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:51:00,663 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-09-23 19:51:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:00,802 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-23 19:51:00,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 19:51:00,802 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-09-23 19:51:00,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:00,803 INFO L225 Difference]: With dead ends: 47 [2018-09-23 19:51:00,804 INFO L226 Difference]: Without dead ends: 46 [2018-09-23 19:51:00,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:51:00,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-23 19:51:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-09-23 19:51:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-23 19:51:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-23 19:51:00,810 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-09-23 19:51:00,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:00,811 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-23 19:51:00,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-23 19:51:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-23 19:51:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-23 19:51:00,812 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:00,812 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-09-23 19:51:00,812 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:00,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-09-23 19:51:00,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:00,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:00,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:00,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:00,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:01,529 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:01,529 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:01,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:01,580 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:01,580 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:01,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:01,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:01,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:01,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:01,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:02,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:02,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-23 19:51:02,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-23 19:51:02,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-23 19:51:02,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-23 19:51:02,126 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-09-23 19:51:02,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:02,230 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-23 19:51:02,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 19:51:02,230 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-23 19:51:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:02,232 INFO L225 Difference]: With dead ends: 51 [2018-09-23 19:51:02,232 INFO L226 Difference]: Without dead ends: 50 [2018-09-23 19:51:02,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-23 19:51:02,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-23 19:51:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-09-23 19:51:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-23 19:51:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-23 19:51:02,238 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-09-23 19:51:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:02,238 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-23 19:51:02,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-23 19:51:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-23 19:51:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-23 19:51:02,239 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:02,239 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-09-23 19:51:02,240 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:02,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-09-23 19:51:02,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:02,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:02,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:02,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:02,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:02,432 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:02,432 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:02,446 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:02,537 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-23 19:51:02,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:02,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:02,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:02,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:02,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:02,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:03,076 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:03,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-23 19:51:03,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-23 19:51:03,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-23 19:51:03,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:51:03,077 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-09-23 19:51:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:03,167 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-23 19:51:03,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 19:51:03,168 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-09-23 19:51:03,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:03,169 INFO L225 Difference]: With dead ends: 55 [2018-09-23 19:51:03,169 INFO L226 Difference]: Without dead ends: 54 [2018-09-23 19:51:03,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:51:03,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-23 19:51:03,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-23 19:51:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-23 19:51:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-23 19:51:03,177 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-09-23 19:51:03,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:03,177 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-23 19:51:03,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-23 19:51:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-23 19:51:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-23 19:51:03,178 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:03,179 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-09-23 19:51:03,179 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:03,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:03,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-09-23 19:51:03,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:03,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:03,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:03,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:03,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:03,659 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:03,659 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:03,667 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:51:03,724 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-23 19:51:03,724 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:03,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:03,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:03,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:03,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:03,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:04,034 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:04,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-23 19:51:04,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-23 19:51:04,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-23 19:51:04,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-23 19:51:04,035 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-09-23 19:51:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:04,152 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-23 19:51:04,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:51:04,152 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-09-23 19:51:04,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:04,153 INFO L225 Difference]: With dead ends: 59 [2018-09-23 19:51:04,154 INFO L226 Difference]: Without dead ends: 58 [2018-09-23 19:51:04,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-23 19:51:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-23 19:51:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-09-23 19:51:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-23 19:51:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-23 19:51:04,164 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-09-23 19:51:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:04,164 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-23 19:51:04,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-23 19:51:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-23 19:51:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-23 19:51:04,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:04,167 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-09-23 19:51:04,167 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:04,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:04,169 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-09-23 19:51:04,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:04,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:04,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:04,421 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:04,421 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:04,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:04,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:04,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:04,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:04,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:04,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:04,807 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:04,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-23 19:51:04,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-23 19:51:04,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-23 19:51:04,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-23 19:51:04,808 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-09-23 19:51:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:05,033 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-23 19:51:05,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:51:05,034 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-09-23 19:51:05,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:05,035 INFO L225 Difference]: With dead ends: 63 [2018-09-23 19:51:05,035 INFO L226 Difference]: Without dead ends: 62 [2018-09-23 19:51:05,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-23 19:51:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-23 19:51:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-23 19:51:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-23 19:51:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-23 19:51:05,041 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-09-23 19:51:05,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:05,041 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-23 19:51:05,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-23 19:51:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-23 19:51:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-23 19:51:05,042 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:05,043 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-09-23 19:51:05,043 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:05,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:05,043 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-09-23 19:51:05,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:05,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:05,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:05,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:05,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:05,319 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:05,319 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:05,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:51:05,352 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:51:05,352 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:05,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:05,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:05,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:05,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:05,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:05,699 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:05,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-23 19:51:05,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-23 19:51:05,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-23 19:51:05,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-23 19:51:05,701 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-09-23 19:51:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:05,842 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-23 19:51:05,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:51:05,843 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-09-23 19:51:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:05,844 INFO L225 Difference]: With dead ends: 67 [2018-09-23 19:51:05,844 INFO L226 Difference]: Without dead ends: 66 [2018-09-23 19:51:05,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-23 19:51:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-23 19:51:05,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-09-23 19:51:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-23 19:51:05,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-23 19:51:05,851 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-09-23 19:51:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:05,852 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-23 19:51:05,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-23 19:51:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-23 19:51:05,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-23 19:51:05,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:05,853 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-09-23 19:51:05,853 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:05,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:05,854 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-09-23 19:51:05,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:05,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:05,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:05,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:05,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:06,328 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:06,328 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:06,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:06,371 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-23 19:51:06,372 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:06,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:06,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:06,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:06,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:06,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:06,678 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:06,678 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-23 19:51:06,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-23 19:51:06,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-23 19:51:06,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 19:51:06,680 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-09-23 19:51:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:06,920 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-23 19:51:06,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-23 19:51:06,921 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-09-23 19:51:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:06,922 INFO L225 Difference]: With dead ends: 71 [2018-09-23 19:51:06,922 INFO L226 Difference]: Without dead ends: 70 [2018-09-23 19:51:06,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 19:51:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-23 19:51:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-09-23 19:51:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-23 19:51:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-23 19:51:06,932 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-09-23 19:51:06,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:06,933 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-23 19:51:06,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-23 19:51:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-23 19:51:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-23 19:51:06,935 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:06,935 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-09-23 19:51:06,935 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:06,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:06,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-09-23 19:51:06,936 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:06,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:06,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:06,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:06,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:07,302 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:07,303 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:07,303 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:07,313 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:07,334 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:07,335 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:07,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:07,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:07,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:07,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:07,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:07,771 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:07,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-23 19:51:07,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-23 19:51:07,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-23 19:51:07,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-23 19:51:07,773 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-09-23 19:51:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:07,909 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-23 19:51:07,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-23 19:51:07,910 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-09-23 19:51:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:07,910 INFO L225 Difference]: With dead ends: 75 [2018-09-23 19:51:07,910 INFO L226 Difference]: Without dead ends: 74 [2018-09-23 19:51:07,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-23 19:51:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-23 19:51:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-09-23 19:51:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-23 19:51:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-23 19:51:07,918 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-09-23 19:51:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:07,919 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-23 19:51:07,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-23 19:51:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-23 19:51:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-23 19:51:07,920 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:07,921 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-09-23 19:51:07,921 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:07,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:07,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-09-23 19:51:07,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:07,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:07,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:08,367 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:08,368 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:08,368 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:08,375 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:08,410 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-23 19:51:08,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:08,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:08,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:08,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:08,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:08,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:08,838 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:08,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-23 19:51:08,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-23 19:51:08,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-23 19:51:08,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-23 19:51:08,840 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-09-23 19:51:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:08,940 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-23 19:51:08,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-23 19:51:08,940 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-09-23 19:51:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:08,942 INFO L225 Difference]: With dead ends: 79 [2018-09-23 19:51:08,942 INFO L226 Difference]: Without dead ends: 78 [2018-09-23 19:51:08,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-23 19:51:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-23 19:51:08,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-09-23 19:51:08,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-23 19:51:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-23 19:51:08,947 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-09-23 19:51:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:08,947 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-23 19:51:08,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-23 19:51:08,947 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-23 19:51:08,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-23 19:51:08,948 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:08,948 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-09-23 19:51:08,948 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:08,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:08,949 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-09-23 19:51:08,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:08,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:08,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:08,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:08,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:09,266 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:09,266 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:09,274 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:51:09,317 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-23 19:51:09,317 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:09,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:09,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:09,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:09,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:09,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:09,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:09,813 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-23 19:51:09,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-23 19:51:09,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-23 19:51:09,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-23 19:51:09,814 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-09-23 19:51:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:09,923 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-23 19:51:09,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:51:09,924 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-09-23 19:51:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:09,925 INFO L225 Difference]: With dead ends: 83 [2018-09-23 19:51:09,925 INFO L226 Difference]: Without dead ends: 82 [2018-09-23 19:51:09,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-23 19:51:09,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-23 19:51:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-09-23 19:51:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-23 19:51:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-23 19:51:09,930 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-09-23 19:51:09,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:09,930 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-23 19:51:09,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-23 19:51:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-23 19:51:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-23 19:51:09,931 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:09,931 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-09-23 19:51:09,931 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:09,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:09,932 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-09-23 19:51:09,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:09,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:09,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:09,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:09,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:10,612 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:10,612 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:10,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:10,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:10,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:10,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:10,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:10,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:11,164 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:11,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-23 19:51:11,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-23 19:51:11,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-23 19:51:11,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-23 19:51:11,167 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-09-23 19:51:11,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:11,381 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-23 19:51:11,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-23 19:51:11,381 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-23 19:51:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:11,383 INFO L225 Difference]: With dead ends: 87 [2018-09-23 19:51:11,383 INFO L226 Difference]: Without dead ends: 86 [2018-09-23 19:51:11,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-23 19:51:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-23 19:51:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-23 19:51:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-23 19:51:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-23 19:51:11,389 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-09-23 19:51:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:11,389 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-23 19:51:11,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-23 19:51:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-23 19:51:11,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-23 19:51:11,390 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:11,390 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-09-23 19:51:11,391 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:11,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:11,391 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-09-23 19:51:11,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:11,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:11,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:11,890 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:11,890 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:11,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:51:11,921 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:51:11,921 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:11,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:11,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:11,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:11,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:11,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:12,420 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:12,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-23 19:51:12,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-23 19:51:12,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-23 19:51:12,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-23 19:51:12,421 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-09-23 19:51:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:12,573 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-23 19:51:12,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 19:51:12,574 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-09-23 19:51:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:12,575 INFO L225 Difference]: With dead ends: 91 [2018-09-23 19:51:12,575 INFO L226 Difference]: Without dead ends: 90 [2018-09-23 19:51:12,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-23 19:51:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-23 19:51:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-09-23 19:51:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-23 19:51:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-23 19:51:12,580 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-09-23 19:51:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:12,581 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-23 19:51:12,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-23 19:51:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-23 19:51:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-23 19:51:12,582 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:12,582 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-09-23 19:51:12,582 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:12,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:12,582 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-09-23 19:51:12,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:12,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:12,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:12,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:12,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:13,245 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:13,245 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:13,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:13,304 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-23 19:51:13,304 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:13,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:13,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:13,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:13,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:13,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:15,314 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:15,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-23 19:51:15,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-23 19:51:15,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-23 19:51:15,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-23 19:51:15,316 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-09-23 19:51:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:15,457 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-23 19:51:15,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 19:51:15,460 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-09-23 19:51:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:15,461 INFO L225 Difference]: With dead ends: 95 [2018-09-23 19:51:15,461 INFO L226 Difference]: Without dead ends: 94 [2018-09-23 19:51:15,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-23 19:51:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-23 19:51:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-09-23 19:51:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-23 19:51:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-23 19:51:15,466 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-09-23 19:51:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:15,466 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-23 19:51:15,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-23 19:51:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-23 19:51:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-23 19:51:15,467 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:15,467 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-09-23 19:51:15,467 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:15,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:15,467 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-09-23 19:51:15,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:15,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:15,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:15,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:15,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:16,029 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:16,029 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:16,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:16,072 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:16,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:16,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:16,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:16,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:16,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:16,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:16,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:16,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-23 19:51:16,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-23 19:51:16,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-23 19:51:16,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-23 19:51:16,535 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-09-23 19:51:16,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:16,688 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-23 19:51:16,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-23 19:51:16,693 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-09-23 19:51:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:16,693 INFO L225 Difference]: With dead ends: 99 [2018-09-23 19:51:16,693 INFO L226 Difference]: Without dead ends: 98 [2018-09-23 19:51:16,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-23 19:51:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-23 19:51:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-09-23 19:51:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-23 19:51:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-23 19:51:16,698 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-09-23 19:51:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:16,698 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-23 19:51:16,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-23 19:51:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-23 19:51:16,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-23 19:51:16,699 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:16,699 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-09-23 19:51:16,699 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:16,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:16,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-09-23 19:51:16,700 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:16,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:16,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:16,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:16,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:17,120 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:17,120 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:17,128 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:17,176 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-23 19:51:17,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:17,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:17,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:17,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:17,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:17,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:17,886 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:17,886 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-23 19:51:17,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-23 19:51:17,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-23 19:51:17,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 19:51:17,888 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-09-23 19:51:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:18,143 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-23 19:51:18,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-23 19:51:18,143 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-23 19:51:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:18,144 INFO L225 Difference]: With dead ends: 103 [2018-09-23 19:51:18,144 INFO L226 Difference]: Without dead ends: 102 [2018-09-23 19:51:18,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 19:51:18,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-23 19:51:18,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-09-23 19:51:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-23 19:51:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-23 19:51:18,149 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-09-23 19:51:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:18,149 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-23 19:51:18,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-23 19:51:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-23 19:51:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-23 19:51:18,150 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:18,150 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-09-23 19:51:18,151 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:18,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:18,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-09-23 19:51:18,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:18,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:18,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:18,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:18,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:18,741 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:18,741 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:18,749 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:51:18,809 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-23 19:51:18,809 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:18,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:18,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:18,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:18,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:18,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:19,312 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:19,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-23 19:51:19,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-23 19:51:19,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-23 19:51:19,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-23 19:51:19,314 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-09-23 19:51:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:19,552 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-23 19:51:19,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-23 19:51:19,552 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-09-23 19:51:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:19,553 INFO L225 Difference]: With dead ends: 107 [2018-09-23 19:51:19,553 INFO L226 Difference]: Without dead ends: 106 [2018-09-23 19:51:19,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-23 19:51:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-23 19:51:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-23 19:51:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-23 19:51:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-23 19:51:19,558 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-09-23 19:51:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:19,558 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-23 19:51:19,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-23 19:51:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-23 19:51:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-23 19:51:19,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:19,559 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-09-23 19:51:19,560 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:19,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:19,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-09-23 19:51:19,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:19,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:19,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:19,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:19,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:20,112 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:20,112 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:20,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:20,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:20,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:20,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:20,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:20,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:20,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:20,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-23 19:51:20,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-23 19:51:20,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-23 19:51:20,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-23 19:51:20,887 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-09-23 19:51:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:21,076 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-23 19:51:21,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-23 19:51:21,077 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-09-23 19:51:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:21,078 INFO L225 Difference]: With dead ends: 111 [2018-09-23 19:51:21,078 INFO L226 Difference]: Without dead ends: 110 [2018-09-23 19:51:21,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-23 19:51:21,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-23 19:51:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-09-23 19:51:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-23 19:51:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-23 19:51:21,083 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-09-23 19:51:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:21,083 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-23 19:51:21,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-23 19:51:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-23 19:51:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-23 19:51:21,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:21,084 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-09-23 19:51:21,084 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:21,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:21,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-09-23 19:51:21,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:21,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:21,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:21,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:21,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:21,612 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:21,612 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:21,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:51:21,648 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:51:21,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:21,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:21,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:21,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:21,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:21,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:22,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:22,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-23 19:51:22,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-23 19:51:22,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-23 19:51:22,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-23 19:51:22,217 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-09-23 19:51:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:22,421 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-23 19:51:22,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-23 19:51:22,422 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-09-23 19:51:22,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:22,423 INFO L225 Difference]: With dead ends: 115 [2018-09-23 19:51:22,423 INFO L226 Difference]: Without dead ends: 114 [2018-09-23 19:51:22,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-23 19:51:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-23 19:51:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-09-23 19:51:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-23 19:51:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-23 19:51:22,429 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-09-23 19:51:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:22,429 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-23 19:51:22,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-23 19:51:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-23 19:51:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-23 19:51:22,430 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:22,430 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-09-23 19:51:22,431 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:22,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:22,431 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-09-23 19:51:22,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:22,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:22,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:22,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:22,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:22,925 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:22,925 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:22,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:23,005 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-23 19:51:23,005 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:23,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:23,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:23,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:23,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:23,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:23,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:23,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-23 19:51:23,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-23 19:51:23,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-23 19:51:23,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-23 19:51:23,860 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-09-23 19:51:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:24,064 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-23 19:51:24,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-23 19:51:24,064 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-23 19:51:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:24,065 INFO L225 Difference]: With dead ends: 119 [2018-09-23 19:51:24,066 INFO L226 Difference]: Without dead ends: 118 [2018-09-23 19:51:24,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-23 19:51:24,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-23 19:51:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-09-23 19:51:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-23 19:51:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-23 19:51:24,071 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-09-23 19:51:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:24,071 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-23 19:51:24,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-23 19:51:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-23 19:51:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-23 19:51:24,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:24,072 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-09-23 19:51:24,072 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:24,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:24,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-09-23 19:51:24,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:24,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:24,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:24,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:24,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:24,622 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:24,622 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:24,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:24,661 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:24,661 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:24,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:24,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:24,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:24,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:24,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:25,343 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:25,344 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-23 19:51:25,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-23 19:51:25,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-23 19:51:25,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-23 19:51:25,345 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-09-23 19:51:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:25,522 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-23 19:51:25,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-23 19:51:25,522 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-09-23 19:51:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:25,524 INFO L225 Difference]: With dead ends: 123 [2018-09-23 19:51:25,524 INFO L226 Difference]: Without dead ends: 122 [2018-09-23 19:51:25,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-23 19:51:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-23 19:51:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-09-23 19:51:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-23 19:51:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-23 19:51:25,530 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-09-23 19:51:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:25,530 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-23 19:51:25,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-23 19:51:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-23 19:51:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-23 19:51:25,531 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:25,531 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-09-23 19:51:25,532 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:25,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:25,532 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-09-23 19:51:25,532 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:25,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:25,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:25,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:25,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:26,177 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:26,177 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:26,184 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:26,254 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-23 19:51:26,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:26,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:26,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 6 treesize of output 5 [2018-09-23 19:51:26,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:26,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:26,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:27,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:27,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-23 19:51:27,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-23 19:51:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-23 19:51:27,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-23 19:51:27,045 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-09-23 19:51:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:27,323 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-23 19:51:27,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-23 19:51:27,324 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-09-23 19:51:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:27,325 INFO L225 Difference]: With dead ends: 127 [2018-09-23 19:51:27,325 INFO L226 Difference]: Without dead ends: 126 [2018-09-23 19:51:27,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-23 19:51:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-23 19:51:27,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-09-23 19:51:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-23 19:51:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-23 19:51:27,331 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-09-23 19:51:27,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:27,331 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-23 19:51:27,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-23 19:51:27,331 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-23 19:51:27,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-23 19:51:27,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:27,332 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-09-23 19:51:27,332 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:27,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:27,332 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-09-23 19:51:27,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:27,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:27,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:27,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:27,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:28,094 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:28,094 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:28,103 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:51:28,190 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-23 19:51:28,190 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:28,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:28,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:28,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:28,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:28,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:29,119 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:29,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-23 19:51:29,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-23 19:51:29,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-23 19:51:29,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-23 19:51:29,121 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-09-23 19:51:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:29,327 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-23 19:51:29,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-23 19:51:29,327 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-09-23 19:51:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:29,329 INFO L225 Difference]: With dead ends: 131 [2018-09-23 19:51:29,329 INFO L226 Difference]: Without dead ends: 130 [2018-09-23 19:51:29,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-23 19:51:29,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-23 19:51:29,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-09-23 19:51:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-23 19:51:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-23 19:51:29,333 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-09-23 19:51:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:29,333 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-23 19:51:29,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-23 19:51:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-23 19:51:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-23 19:51:29,334 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:29,334 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-09-23 19:51:29,334 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:29,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:29,334 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-09-23 19:51:29,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:29,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:29,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:29,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:29,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:30,027 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:30,028 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:30,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:30,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:30,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:30,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:30,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:30,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:30,829 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:30,829 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-23 19:51:30,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-23 19:51:30,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-23 19:51:30,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-23 19:51:30,831 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-09-23 19:51:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:31,031 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-23 19:51:31,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-23 19:51:31,032 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-09-23 19:51:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:31,033 INFO L225 Difference]: With dead ends: 135 [2018-09-23 19:51:31,033 INFO L226 Difference]: Without dead ends: 134 [2018-09-23 19:51:31,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-23 19:51:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-23 19:51:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-09-23 19:51:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-23 19:51:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-23 19:51:31,039 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-09-23 19:51:31,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:31,040 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-23 19:51:31,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-23 19:51:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-23 19:51:31,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-23 19:51:31,040 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:31,041 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-09-23 19:51:31,041 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:31,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:31,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-09-23 19:51:31,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:31,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:31,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:31,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:31,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:31,781 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:31,781 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:31,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:51:31,837 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:51:31,837 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:31,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:31,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:31,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:31,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:31,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:32,930 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:32,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-23 19:51:32,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-23 19:51:32,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-23 19:51:32,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-23 19:51:32,932 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-09-23 19:51:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:33,171 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-23 19:51:33,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-23 19:51:33,172 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-23 19:51:33,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:33,173 INFO L225 Difference]: With dead ends: 139 [2018-09-23 19:51:33,173 INFO L226 Difference]: Without dead ends: 138 [2018-09-23 19:51:33,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-23 19:51:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-23 19:51:33,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-09-23 19:51:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-23 19:51:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-23 19:51:33,178 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-09-23 19:51:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:33,179 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-23 19:51:33,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-23 19:51:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-23 19:51:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-23 19:51:33,180 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:33,180 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-09-23 19:51:33,180 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:33,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:33,180 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-09-23 19:51:33,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:33,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:33,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:33,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:33,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:34,166 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:34,166 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:34,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:34,344 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-23 19:51:34,344 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:34,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:34,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:34,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:34,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:34,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:36,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:36,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-23 19:51:36,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-23 19:51:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-23 19:51:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-23 19:51:36,642 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-09-23 19:51:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:37,010 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-23 19:51:37,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-23 19:51:37,011 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-09-23 19:51:37,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:37,012 INFO L225 Difference]: With dead ends: 143 [2018-09-23 19:51:37,012 INFO L226 Difference]: Without dead ends: 142 [2018-09-23 19:51:37,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-23 19:51:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-23 19:51:37,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-09-23 19:51:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-23 19:51:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-23 19:51:37,018 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-09-23 19:51:37,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:37,018 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-23 19:51:37,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-23 19:51:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-23 19:51:37,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-23 19:51:37,019 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:37,020 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-09-23 19:51:37,020 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:37,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:37,020 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-09-23 19:51:37,020 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:37,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:37,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:37,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:37,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:37,777 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:37,777 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:37,790 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:37,830 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:37,830 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:37,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:37,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:37,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:37,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:37,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:39,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:39,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-23 19:51:39,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-23 19:51:39,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-23 19:51:39,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-23 19:51:39,137 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-09-23 19:51:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:39,585 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-23 19:51:39,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-23 19:51:39,585 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-09-23 19:51:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:39,586 INFO L225 Difference]: With dead ends: 147 [2018-09-23 19:51:39,587 INFO L226 Difference]: Without dead ends: 146 [2018-09-23 19:51:39,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-23 19:51:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-23 19:51:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-09-23 19:51:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-23 19:51:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-23 19:51:39,592 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-09-23 19:51:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:39,592 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-23 19:51:39,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-23 19:51:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-23 19:51:39,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-23 19:51:39,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:39,594 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-09-23 19:51:39,594 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:39,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:39,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-09-23 19:51:39,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:39,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:39,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:39,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:39,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:40,537 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:40,537 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:40,545 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:40,623 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-23 19:51:40,624 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:40,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:40,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:40,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:40,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:40,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:41,524 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:41,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-23 19:51:41,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-23 19:51:41,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-23 19:51:41,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-23 19:51:41,526 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-09-23 19:51:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:41,905 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-23 19:51:41,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-23 19:51:41,905 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-09-23 19:51:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:41,907 INFO L225 Difference]: With dead ends: 151 [2018-09-23 19:51:41,907 INFO L226 Difference]: Without dead ends: 150 [2018-09-23 19:51:41,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-23 19:51:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-23 19:51:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-09-23 19:51:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-23 19:51:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-23 19:51:41,913 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-09-23 19:51:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:41,913 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-23 19:51:41,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-23 19:51:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-23 19:51:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-23 19:51:41,914 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:41,914 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-09-23 19:51:41,915 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:41,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:41,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-09-23 19:51:41,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:41,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:41,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:41,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:41,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:42,744 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:42,744 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:42,752 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:51:42,861 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-23 19:51:42,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:42,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:42,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:42,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:42,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:42,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:44,000 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:44,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-23 19:51:44,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-23 19:51:44,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-23 19:51:44,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-23 19:51:44,002 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-09-23 19:51:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:44,291 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-23 19:51:44,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-23 19:51:44,291 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-09-23 19:51:44,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:44,293 INFO L225 Difference]: With dead ends: 155 [2018-09-23 19:51:44,293 INFO L226 Difference]: Without dead ends: 154 [2018-09-23 19:51:44,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-23 19:51:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-23 19:51:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-09-23 19:51:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-23 19:51:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-23 19:51:44,300 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-09-23 19:51:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:44,300 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-23 19:51:44,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-23 19:51:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-23 19:51:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-23 19:51:44,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:44,302 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-09-23 19:51:44,302 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:44,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:44,302 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-09-23 19:51:44,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:44,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:44,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:44,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:44,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:45,187 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:45,187 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:45,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:45,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:45,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:45,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:45,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:45,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:46,323 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:46,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-23 19:51:46,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-23 19:51:46,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-23 19:51:46,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-23 19:51:46,325 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-09-23 19:51:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:46,599 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-23 19:51:46,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-23 19:51:46,600 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-09-23 19:51:46,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:46,601 INFO L225 Difference]: With dead ends: 159 [2018-09-23 19:51:46,601 INFO L226 Difference]: Without dead ends: 158 [2018-09-23 19:51:46,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-23 19:51:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-23 19:51:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-23 19:51:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-23 19:51:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-23 19:51:46,607 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-09-23 19:51:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:46,607 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-23 19:51:46,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-23 19:51:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-23 19:51:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-23 19:51:46,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:46,608 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-09-23 19:51:46,608 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:46,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:46,608 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-09-23 19:51:46,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:46,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:46,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:46,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:51:46,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:48,348 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:48,348 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:48,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:51:48,398 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:51:48,398 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:48,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:48,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:48,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:48,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:48,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:49,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:49,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-23 19:51:49,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-23 19:51:49,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-23 19:51:49,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-23 19:51:49,760 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-09-23 19:51:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:50,003 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-23 19:51:50,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-23 19:51:50,004 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-09-23 19:51:50,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:50,005 INFO L225 Difference]: With dead ends: 163 [2018-09-23 19:51:50,005 INFO L226 Difference]: Without dead ends: 162 [2018-09-23 19:51:50,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-23 19:51:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-23 19:51:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-23 19:51:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-23 19:51:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-23 19:51:50,012 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-09-23 19:51:50,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:50,012 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-23 19:51:50,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-23 19:51:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-23 19:51:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-23 19:51:50,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:50,013 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-09-23 19:51:50,013 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:50,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:50,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-09-23 19:51:50,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:50,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:50,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:50,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:50,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:51,566 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:51,566 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:51,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:51:51,897 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-23 19:51:51,897 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:51,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:51,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:51,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:51,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:51,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:52,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:52,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-23 19:51:52,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-23 19:51:52,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-23 19:51:52,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-23 19:51:52,956 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-09-23 19:51:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:53,231 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-23 19:51:53,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-23 19:51:53,232 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-09-23 19:51:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:53,233 INFO L225 Difference]: With dead ends: 167 [2018-09-23 19:51:53,234 INFO L226 Difference]: Without dead ends: 166 [2018-09-23 19:51:53,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-23 19:51:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-23 19:51:53,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-23 19:51:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-23 19:51:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-23 19:51:53,240 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-09-23 19:51:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:53,240 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-23 19:51:53,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-23 19:51:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-23 19:51:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-23 19:51:53,241 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:53,241 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-09-23 19:51:53,242 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:53,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:53,242 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-09-23 19:51:53,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:53,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:53,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:53,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:53,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:54,993 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:54,993 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:55,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:51:55,044 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:51:55,044 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:55,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:55,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:55,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:55,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:55,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:56,235 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:56,235 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-23 19:51:56,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-23 19:51:56,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-23 19:51:56,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-23 19:51:56,236 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-09-23 19:51:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:51:56,663 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-23 19:51:56,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-23 19:51:56,664 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-09-23 19:51:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:51:56,665 INFO L225 Difference]: With dead ends: 171 [2018-09-23 19:51:56,665 INFO L226 Difference]: Without dead ends: 170 [2018-09-23 19:51:56,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-23 19:51:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-23 19:51:56,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-23 19:51:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-23 19:51:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-23 19:51:56,671 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-09-23 19:51:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:51:56,672 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-23 19:51:56,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-23 19:51:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-23 19:51:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-23 19:51:56,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:51:56,673 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-09-23 19:51:56,673 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:51:56,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:51:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-09-23 19:51:56,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:51:56,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:51:56,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:56,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:51:56,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:51:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:51:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:58,263 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:51:58,263 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:51:58,273 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:51:58,440 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-23 19:51:58,440 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:51:58,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:51:58,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:51:58,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:51:58,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:51:58,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:51:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:51:59,950 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:51:59,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-23 19:51:59,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-23 19:51:59,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-23 19:51:59,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-23 19:51:59,952 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-09-23 19:52:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:00,285 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-23 19:52:00,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-23 19:52:00,285 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-09-23 19:52:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:00,286 INFO L225 Difference]: With dead ends: 175 [2018-09-23 19:52:00,287 INFO L226 Difference]: Without dead ends: 174 [2018-09-23 19:52:00,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-23 19:52:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-23 19:52:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-23 19:52:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-23 19:52:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-23 19:52:00,293 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-09-23 19:52:00,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:00,293 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-23 19:52:00,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-23 19:52:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-23 19:52:00,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-23 19:52:00,295 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:00,295 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-09-23 19:52:00,295 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:00,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:00,295 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-09-23 19:52:00,296 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:00,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:00,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:00,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:00,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:02,136 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:02,136 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:02,147 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:52:02,409 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-23 19:52:02,409 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:02,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:02,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:02,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:02,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:02,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:03,661 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:03,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-23 19:52:03,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-23 19:52:03,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-23 19:52:03,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-23 19:52:03,663 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-09-23 19:52:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:04,325 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-23 19:52:04,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-23 19:52:04,325 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-09-23 19:52:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:04,326 INFO L225 Difference]: With dead ends: 179 [2018-09-23 19:52:04,326 INFO L226 Difference]: Without dead ends: 178 [2018-09-23 19:52:04,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-23 19:52:04,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-23 19:52:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-23 19:52:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-23 19:52:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-23 19:52:04,333 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-09-23 19:52:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:04,333 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-23 19:52:04,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-23 19:52:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-23 19:52:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-23 19:52:04,334 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:04,334 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-09-23 19:52:04,334 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:04,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:04,335 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-09-23 19:52:04,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:04,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:04,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:04,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:04,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:05,426 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:05,426 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:05,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:05,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:05,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:05,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:05,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:05,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:06,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:06,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-23 19:52:06,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-23 19:52:06,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-23 19:52:06,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-23 19:52:06,794 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-09-23 19:52:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:07,079 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-23 19:52:07,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-23 19:52:07,080 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-09-23 19:52:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:07,081 INFO L225 Difference]: With dead ends: 183 [2018-09-23 19:52:07,081 INFO L226 Difference]: Without dead ends: 182 [2018-09-23 19:52:07,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-23 19:52:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-23 19:52:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-09-23 19:52:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-23 19:52:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-23 19:52:07,086 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-09-23 19:52:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:07,087 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-23 19:52:07,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-23 19:52:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-23 19:52:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-23 19:52:07,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:07,087 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-09-23 19:52:07,088 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:07,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-09-23 19:52:07,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:07,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:07,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:08,649 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:08,649 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:08,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:52:08,706 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:52:08,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:08,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:08,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:08,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:08,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:08,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:10,368 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:10,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-23 19:52:10,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-23 19:52:10,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-23 19:52:10,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-23 19:52:10,370 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-09-23 19:52:10,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:10,653 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-23 19:52:10,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-23 19:52:10,653 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-09-23 19:52:10,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:10,655 INFO L225 Difference]: With dead ends: 187 [2018-09-23 19:52:10,655 INFO L226 Difference]: Without dead ends: 186 [2018-09-23 19:52:10,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-23 19:52:10,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-23 19:52:10,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-09-23 19:52:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-23 19:52:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-23 19:52:10,661 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-09-23 19:52:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:10,662 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-23 19:52:10,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-23 19:52:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-23 19:52:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-23 19:52:10,663 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:10,663 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-09-23 19:52:10,663 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:10,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-09-23 19:52:10,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:10,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:10,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:10,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:10,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:11,899 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:11,899 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:11,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:52:12,072 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-23 19:52:12,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:12,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:12,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:12,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:12,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:12,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:13,458 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:13,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-23 19:52:13,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-23 19:52:13,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-23 19:52:13,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-23 19:52:13,460 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-09-23 19:52:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:13,782 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-23 19:52:13,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-23 19:52:13,783 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-09-23 19:52:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:13,784 INFO L225 Difference]: With dead ends: 191 [2018-09-23 19:52:13,784 INFO L226 Difference]: Without dead ends: 190 [2018-09-23 19:52:13,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-23 19:52:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-23 19:52:13,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-09-23 19:52:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-23 19:52:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-23 19:52:13,790 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-09-23 19:52:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:13,790 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-23 19:52:13,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-23 19:52:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-23 19:52:13,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-23 19:52:13,792 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:13,792 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-09-23 19:52:13,792 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:13,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:13,792 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-09-23 19:52:13,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:13,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:13,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:13,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:13,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:15,498 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:15,498 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:15,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:52:15,557 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:52:15,557 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:15,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:15,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:15,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:15,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:15,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:18,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:18,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-23 19:52:18,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-23 19:52:18,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-23 19:52:18,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-23 19:52:18,052 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-09-23 19:52:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:18,512 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-23 19:52:18,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-23 19:52:18,512 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-09-23 19:52:18,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:18,517 INFO L225 Difference]: With dead ends: 195 [2018-09-23 19:52:18,517 INFO L226 Difference]: Without dead ends: 194 [2018-09-23 19:52:18,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-23 19:52:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-23 19:52:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-09-23 19:52:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-23 19:52:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-23 19:52:18,521 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-09-23 19:52:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:18,522 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-23 19:52:18,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-23 19:52:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-23 19:52:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-23 19:52:18,523 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:18,523 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-09-23 19:52:18,523 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:18,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:18,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-09-23 19:52:18,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:18,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:18,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:18,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:18,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:20,174 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:20,174 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:20,182 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:52:20,311 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-23 19:52:20,311 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:20,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:20,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:20,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:20,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:20,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:21,961 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:21,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-23 19:52:21,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-23 19:52:21,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-23 19:52:21,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-23 19:52:21,962 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-09-23 19:52:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:22,401 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-23 19:52:22,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-23 19:52:22,401 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-09-23 19:52:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:22,403 INFO L225 Difference]: With dead ends: 199 [2018-09-23 19:52:22,403 INFO L226 Difference]: Without dead ends: 198 [2018-09-23 19:52:22,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-23 19:52:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-23 19:52:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-09-23 19:52:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-23 19:52:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-23 19:52:22,409 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-09-23 19:52:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:22,409 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-23 19:52:22,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-23 19:52:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-23 19:52:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-23 19:52:22,410 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:22,410 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-09-23 19:52:22,410 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:22,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:22,411 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-09-23 19:52:22,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:22,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:22,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:22,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:22,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:23,696 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:23,696 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:23,703 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:52:23,855 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-23 19:52:23,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:23,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:23,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:23,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:23,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:23,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:25,586 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:25,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-23 19:52:25,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-23 19:52:25,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-23 19:52:25,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-23 19:52:25,589 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-09-23 19:52:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:25,954 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-23 19:52:25,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-23 19:52:25,954 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-09-23 19:52:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:25,956 INFO L225 Difference]: With dead ends: 203 [2018-09-23 19:52:25,956 INFO L226 Difference]: Without dead ends: 202 [2018-09-23 19:52:25,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-23 19:52:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-23 19:52:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-09-23 19:52:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-23 19:52:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-23 19:52:25,963 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-09-23 19:52:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:25,963 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-23 19:52:25,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-23 19:52:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-23 19:52:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-23 19:52:25,964 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:25,964 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-09-23 19:52:25,964 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:25,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:25,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-09-23 19:52:25,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:25,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:25,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:25,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:25,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:27,441 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:27,441 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:27,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:27,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:27,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:27,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:27,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:27,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:29,072 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:29,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-23 19:52:29,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-23 19:52:29,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-23 19:52:29,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-23 19:52:29,074 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-09-23 19:52:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:29,398 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-23 19:52:29,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-23 19:52:29,399 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-09-23 19:52:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:29,400 INFO L225 Difference]: With dead ends: 207 [2018-09-23 19:52:29,401 INFO L226 Difference]: Without dead ends: 206 [2018-09-23 19:52:29,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-23 19:52:29,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-23 19:52:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-09-23 19:52:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-23 19:52:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-23 19:52:29,406 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-09-23 19:52:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:29,406 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-23 19:52:29,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-23 19:52:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-23 19:52:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-23 19:52:29,407 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:29,407 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-09-23 19:52:29,407 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:29,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:29,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-09-23 19:52:29,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:29,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:29,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:29,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:30,998 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:30,998 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:31,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:52:31,057 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:52:31,058 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:31,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:31,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:31,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:31,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:31,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:33,017 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:33,017 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-23 19:52:33,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-23 19:52:33,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-23 19:52:33,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-23 19:52:33,019 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-09-23 19:52:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:33,332 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-23 19:52:33,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-23 19:52:33,332 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-09-23 19:52:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:33,334 INFO L225 Difference]: With dead ends: 211 [2018-09-23 19:52:33,334 INFO L226 Difference]: Without dead ends: 210 [2018-09-23 19:52:33,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-23 19:52:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-23 19:52:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-09-23 19:52:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-23 19:52:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-23 19:52:33,340 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-09-23 19:52:33,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:33,340 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-23 19:52:33,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-23 19:52:33,341 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-23 19:52:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-23 19:52:33,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:33,342 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-09-23 19:52:33,342 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:33,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:33,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-09-23 19:52:33,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:33,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:33,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:33,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:33,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:34,727 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:34,727 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:34,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:52:35,098 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-23 19:52:35,099 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:35,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:35,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:35,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:35,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:35,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:36,820 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:36,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-23 19:52:36,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-23 19:52:36,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-23 19:52:36,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-23 19:52:36,822 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-09-23 19:52:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:37,158 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-23 19:52:37,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-23 19:52:37,158 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-09-23 19:52:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:37,160 INFO L225 Difference]: With dead ends: 215 [2018-09-23 19:52:37,161 INFO L226 Difference]: Without dead ends: 214 [2018-09-23 19:52:37,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-23 19:52:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-23 19:52:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-09-23 19:52:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-23 19:52:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-23 19:52:37,167 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-09-23 19:52:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:37,167 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-23 19:52:37,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-23 19:52:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-23 19:52:37,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-23 19:52:37,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:37,168 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-09-23 19:52:37,169 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:37,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:37,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-09-23 19:52:37,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:37,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:37,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:37,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:37,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:38,609 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:38,609 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:38,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:52:38,770 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:52:38,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:38,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:38,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:38,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:38,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:38,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:40,828 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:40,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-23 19:52:40,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-23 19:52:40,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-23 19:52:40,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-23 19:52:40,830 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-09-23 19:52:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:41,174 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-23 19:52:41,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-23 19:52:41,174 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-09-23 19:52:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:41,176 INFO L225 Difference]: With dead ends: 219 [2018-09-23 19:52:41,176 INFO L226 Difference]: Without dead ends: 218 [2018-09-23 19:52:41,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-23 19:52:41,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-23 19:52:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-09-23 19:52:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-23 19:52:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-23 19:52:41,180 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-09-23 19:52:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:41,180 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-23 19:52:41,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-23 19:52:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-23 19:52:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-23 19:52:41,182 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:41,182 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-09-23 19:52:41,182 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:41,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:41,182 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-09-23 19:52:41,182 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:41,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:41,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:41,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:41,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:42,751 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:42,751 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:42,759 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:52:42,910 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-23 19:52:42,911 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:42,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:42,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:42,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:42,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:42,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:44,723 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:44,723 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-23 19:52:44,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-23 19:52:44,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-23 19:52:44,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-23 19:52:44,725 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-09-23 19:52:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:45,116 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-23 19:52:45,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-23 19:52:45,116 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-09-23 19:52:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:45,117 INFO L225 Difference]: With dead ends: 223 [2018-09-23 19:52:45,118 INFO L226 Difference]: Without dead ends: 222 [2018-09-23 19:52:45,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-23 19:52:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-23 19:52:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-09-23 19:52:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-23 19:52:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-23 19:52:45,123 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-09-23 19:52:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:45,123 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-23 19:52:45,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-23 19:52:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-23 19:52:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-23 19:52:45,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:45,124 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-09-23 19:52:45,124 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:45,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:45,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-09-23 19:52:45,124 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:45,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:45,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:45,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:45,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:46,777 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:46,777 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:46,784 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:52:46,979 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-23 19:52:46,979 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:46,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:46,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:46,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:46,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:46,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:48,937 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:48,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-23 19:52:48,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-23 19:52:48,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-23 19:52:48,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-23 19:52:48,939 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-09-23 19:52:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:49,257 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-23 19:52:49,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-23 19:52:49,257 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-09-23 19:52:49,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:49,259 INFO L225 Difference]: With dead ends: 227 [2018-09-23 19:52:49,259 INFO L226 Difference]: Without dead ends: 226 [2018-09-23 19:52:49,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-23 19:52:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-23 19:52:49,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-09-23 19:52:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-23 19:52:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-23 19:52:49,265 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-09-23 19:52:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:49,266 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-23 19:52:49,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-23 19:52:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-23 19:52:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-23 19:52:49,267 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:49,267 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-09-23 19:52:49,267 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:49,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:49,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-09-23 19:52:49,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:49,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:49,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:51,206 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:51,206 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:51,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:51,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:51,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:51,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:51,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:51,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:53,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:53,230 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:53,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-23 19:52:53,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-23 19:52:53,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-23 19:52:53,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-23 19:52:53,232 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-09-23 19:52:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:53,631 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-23 19:52:53,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-23 19:52:53,631 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-09-23 19:52:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:53,633 INFO L225 Difference]: With dead ends: 231 [2018-09-23 19:52:53,633 INFO L226 Difference]: Without dead ends: 230 [2018-09-23 19:52:53,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-23 19:52:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-23 19:52:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-09-23 19:52:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-23 19:52:53,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-23 19:52:53,640 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-09-23 19:52:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:53,640 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-23 19:52:53,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-23 19:52:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-23 19:52:53,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-23 19:52:53,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:53,641 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-09-23 19:52:53,642 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:53,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:53,642 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-09-23 19:52:53,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:53,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:53,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:53,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:52:53,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:52:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:55,345 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:52:55,345 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:52:55,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:52:55,413 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:52:55,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:52:55,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:52:55,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:52:55,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:52:55,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:52:55,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:52:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:52:57,601 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:52:57,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-23 19:52:57,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-23 19:52:57,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-23 19:52:57,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-23 19:52:57,604 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-09-23 19:52:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:52:58,032 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-23 19:52:58,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-23 19:52:58,033 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-09-23 19:52:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:52:58,035 INFO L225 Difference]: With dead ends: 235 [2018-09-23 19:52:58,035 INFO L226 Difference]: Without dead ends: 234 [2018-09-23 19:52:58,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-23 19:52:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-23 19:52:58,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-09-23 19:52:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-23 19:52:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-23 19:52:58,041 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-09-23 19:52:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:52:58,042 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-23 19:52:58,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-23 19:52:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-23 19:52:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-23 19:52:58,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:52:58,043 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-09-23 19:52:58,044 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:52:58,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:52:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-09-23 19:52:58,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:52:58,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:52:58,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:58,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:52:58,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:52:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:00,214 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:00,215 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:00,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:53:00,468 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-23 19:53:00,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:00,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:00,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:00,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:00,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:00,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:02,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:02,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-23 19:53:02,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-23 19:53:02,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-23 19:53:02,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-23 19:53:02,937 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-09-23 19:53:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:03,358 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-23 19:53:03,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-23 19:53:03,359 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-09-23 19:53:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:03,360 INFO L225 Difference]: With dead ends: 239 [2018-09-23 19:53:03,360 INFO L226 Difference]: Without dead ends: 238 [2018-09-23 19:53:03,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-23 19:53:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-23 19:53:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-09-23 19:53:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-23 19:53:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-23 19:53:03,366 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-09-23 19:53:03,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:03,366 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-23 19:53:03,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-23 19:53:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-23 19:53:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-23 19:53:03,367 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:03,367 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-09-23 19:53:03,367 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:03,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-09-23 19:53:03,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:03,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:03,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:05,146 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:05,146 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:05,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:53:05,221 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:53:05,222 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:05,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:05,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:05,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:05,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:05,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:07,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:07,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-23 19:53:07,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-23 19:53:07,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-23 19:53:07,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-23 19:53:07,551 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-09-23 19:53:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:07,978 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-23 19:53:07,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-23 19:53:07,979 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-09-23 19:53:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:07,981 INFO L225 Difference]: With dead ends: 243 [2018-09-23 19:53:07,981 INFO L226 Difference]: Without dead ends: 242 [2018-09-23 19:53:07,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-23 19:53:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-23 19:53:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-09-23 19:53:07,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-23 19:53:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-23 19:53:07,986 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-09-23 19:53:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:07,987 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-23 19:53:07,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-23 19:53:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-23 19:53:07,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-23 19:53:07,987 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:07,988 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-09-23 19:53:07,988 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:07,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-09-23 19:53:07,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:07,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:07,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:07,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:07,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:09,772 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:09,772 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:09,779 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:53:09,944 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-23 19:53:09,944 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:09,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:09,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:09,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:09,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:09,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:12,320 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:12,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-23 19:53:12,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-23 19:53:12,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-23 19:53:12,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-23 19:53:12,323 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-09-23 19:53:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:12,707 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-09-23 19:53:12,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-23 19:53:12,707 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-09-23 19:53:12,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:12,709 INFO L225 Difference]: With dead ends: 247 [2018-09-23 19:53:12,709 INFO L226 Difference]: Without dead ends: 246 [2018-09-23 19:53:12,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-23 19:53:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-23 19:53:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-09-23 19:53:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-23 19:53:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-23 19:53:12,716 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-09-23 19:53:12,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:12,716 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-23 19:53:12,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-23 19:53:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-23 19:53:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-23 19:53:12,717 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:12,718 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-09-23 19:53:12,718 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:12,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:12,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-09-23 19:53:12,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:12,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:12,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:12,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:12,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:14,572 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:14,572 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:14,593 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:53:14,813 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-09-23 19:53:14,813 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:14,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:14,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:14,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:14,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:14,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:17,324 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:17,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-23 19:53:17,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-23 19:53:17,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-23 19:53:17,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-23 19:53:17,326 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-09-23 19:53:17,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:17,813 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-23 19:53:17,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-23 19:53:17,813 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-09-23 19:53:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:17,815 INFO L225 Difference]: With dead ends: 251 [2018-09-23 19:53:17,815 INFO L226 Difference]: Without dead ends: 250 [2018-09-23 19:53:17,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-23 19:53:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-23 19:53:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-09-23 19:53:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-23 19:53:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-09-23 19:53:17,821 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-09-23 19:53:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:17,822 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-09-23 19:53:17,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-23 19:53:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-09-23 19:53:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-23 19:53:17,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:17,823 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-09-23 19:53:17,823 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:17,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:17,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-09-23 19:53:17,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:17,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:17,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:17,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:17,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:19,700 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:19,700 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:19,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:53:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:19,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:19,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:19,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:19,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:19,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:22,462 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:22,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-09-23 19:53:22,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-23 19:53:22,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-23 19:53:22,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-23 19:53:22,465 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-09-23 19:53:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:22,904 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-23 19:53:22,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-23 19:53:22,904 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-09-23 19:53:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:22,906 INFO L225 Difference]: With dead ends: 255 [2018-09-23 19:53:22,906 INFO L226 Difference]: Without dead ends: 254 [2018-09-23 19:53:22,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-23 19:53:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-23 19:53:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-09-23 19:53:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-23 19:53:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-09-23 19:53:22,912 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-09-23 19:53:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:22,912 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-09-23 19:53:22,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-23 19:53:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-09-23 19:53:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-23 19:53:22,913 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:22,913 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-09-23 19:53:22,913 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:22,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:22,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-09-23 19:53:22,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:22,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:22,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:22,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:53:22,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:24,911 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:24,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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:24,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:53:24,977 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:53:24,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:24,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:24,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:24,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:24,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:24,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:27,730 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:27,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-09-23 19:53:27,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-23 19:53:27,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-23 19:53:27,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-23 19:53:27,733 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-09-23 19:53:28,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:28,174 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-09-23 19:53:28,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-23 19:53:28,175 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-09-23 19:53:28,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:28,177 INFO L225 Difference]: With dead ends: 259 [2018-09-23 19:53:28,177 INFO L226 Difference]: Without dead ends: 258 [2018-09-23 19:53:28,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-23 19:53:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-23 19:53:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-09-23 19:53:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-23 19:53:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-23 19:53:28,182 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-09-23 19:53:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:28,182 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-23 19:53:28,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-23 19:53:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-23 19:53:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-23 19:53:28,183 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:28,183 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-09-23 19:53:28,183 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:28,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:28,184 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-09-23 19:53:28,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:28,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:28,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:28,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:28,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:30,238 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:30,238 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:30,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:53:30,550 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-09-23 19:53:30,550 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:30,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:30,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:30,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:30,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:30,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:33,341 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:33,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-09-23 19:53:33,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-23 19:53:33,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-23 19:53:33,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-23 19:53:33,344 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-09-23 19:53:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:33,815 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-09-23 19:53:33,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-23 19:53:33,816 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-09-23 19:53:33,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:33,817 INFO L225 Difference]: With dead ends: 263 [2018-09-23 19:53:33,817 INFO L226 Difference]: Without dead ends: 262 [2018-09-23 19:53:33,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-23 19:53:33,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-23 19:53:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-09-23 19:53:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-23 19:53:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-23 19:53:33,823 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-09-23 19:53:33,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:33,823 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-23 19:53:33,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-23 19:53:33,824 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-23 19:53:33,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-23 19:53:33,825 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:33,825 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-09-23 19:53:33,825 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:33,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:33,826 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-09-23 19:53:33,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:33,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:33,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:33,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:33,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:35,945 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:35,945 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:35,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:53:36,025 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:53:36,026 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:36,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:36,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:36,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:36,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:36,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:39,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:39,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-09-23 19:53:39,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-23 19:53:39,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-23 19:53:39,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-23 19:53:39,113 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-09-23 19:53:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:39,595 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-09-23 19:53:39,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-23 19:53:39,595 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-09-23 19:53:39,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:39,597 INFO L225 Difference]: With dead ends: 267 [2018-09-23 19:53:39,597 INFO L226 Difference]: Without dead ends: 266 [2018-09-23 19:53:39,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-23 19:53:39,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-23 19:53:39,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-09-23 19:53:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-23 19:53:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-09-23 19:53:39,605 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-09-23 19:53:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:39,605 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-09-23 19:53:39,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-23 19:53:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-09-23 19:53:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-23 19:53:39,606 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:39,607 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-09-23 19:53:39,607 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:39,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:39,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-09-23 19:53:39,607 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:39,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:39,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:39,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:39,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:42,100 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:42,100 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:42,107 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:53:42,300 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-09-23 19:53:42,300 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:42,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:42,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:42,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:42,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:42,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:44,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:44,942 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-09-23 19:53:44,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-23 19:53:44,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-23 19:53:44,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-23 19:53:44,944 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-09-23 19:53:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:45,445 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-23 19:53:45,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-23 19:53:45,445 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-09-23 19:53:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:45,447 INFO L225 Difference]: With dead ends: 271 [2018-09-23 19:53:45,447 INFO L226 Difference]: Without dead ends: 270 [2018-09-23 19:53:45,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-23 19:53:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-23 19:53:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-09-23 19:53:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-23 19:53:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-23 19:53:45,454 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-09-23 19:53:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:45,454 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-23 19:53:45,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-23 19:53:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-23 19:53:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-23 19:53:45,456 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:45,456 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-09-23 19:53:45,456 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:45,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:45,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-09-23 19:53:45,457 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:45,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:45,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:45,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:45,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:48,027 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:48,027 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:48,033 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:53:48,292 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-09-23 19:53:48,292 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:48,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:48,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:48,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:48,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:48,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:51,088 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:51,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-09-23 19:53:51,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-23 19:53:51,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-23 19:53:51,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-23 19:53:51,090 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-09-23 19:53:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:51,681 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-23 19:53:51,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-23 19:53:51,681 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-09-23 19:53:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:51,682 INFO L225 Difference]: With dead ends: 275 [2018-09-23 19:53:51,682 INFO L226 Difference]: Without dead ends: 274 [2018-09-23 19:53:51,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-23 19:53:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-23 19:53:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-09-23 19:53:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-23 19:53:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-09-23 19:53:51,688 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-09-23 19:53:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:51,688 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-09-23 19:53:51,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-23 19:53:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-09-23 19:53:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-23 19:53:51,689 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:51,689 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-09-23 19:53:51,689 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:51,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:51,689 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-09-23 19:53:51,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:51,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:51,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:51,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:53:51,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:54,024 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:54,024 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:54,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:53:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:54,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:54,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:54,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:54,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:54,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:53:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:56,865 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:53:56,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-09-23 19:53:56,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-23 19:53:56,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-23 19:53:56,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-23 19:53:56,867 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-09-23 19:53:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:53:57,334 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-09-23 19:53:57,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-23 19:53:57,334 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-09-23 19:53:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:53:57,336 INFO L225 Difference]: With dead ends: 279 [2018-09-23 19:53:57,336 INFO L226 Difference]: Without dead ends: 278 [2018-09-23 19:53:57,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-23 19:53:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-23 19:53:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-09-23 19:53:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-23 19:53:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-23 19:53:57,342 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-09-23 19:53:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:53:57,343 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-23 19:53:57,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-23 19:53:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-23 19:53:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-23 19:53:57,344 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:53:57,344 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-09-23 19:53:57,345 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:53:57,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:53:57,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-09-23 19:53:57,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:53:57,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:53:57,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:57,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:53:57,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:53:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:53:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:53:59,734 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:53:59,734 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:53:59,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:53:59,809 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:53:59,809 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:53:59,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:53:59,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:53:59,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:53:59,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:53:59,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:03,037 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:03,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-09-23 19:54:03,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-23 19:54:03,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-23 19:54:03,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-23 19:54:03,040 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-09-23 19:54:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:03,544 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-09-23 19:54:03,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-23 19:54:03,544 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-09-23 19:54:03,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:03,546 INFO L225 Difference]: With dead ends: 283 [2018-09-23 19:54:03,546 INFO L226 Difference]: Without dead ends: 282 [2018-09-23 19:54:03,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-23 19:54:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-23 19:54:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-09-23 19:54:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-23 19:54:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-23 19:54:03,554 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-09-23 19:54:03,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:03,554 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-23 19:54:03,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-23 19:54:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-23 19:54:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-23 19:54:03,556 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:03,556 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-09-23 19:54:03,556 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:03,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:03,556 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-09-23 19:54:03,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:03,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:03,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:03,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:03,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:05,917 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:05,917 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:05,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:54:06,299 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-09-23 19:54:06,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:06,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:06,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:06,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:06,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:06,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:09,389 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:09,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-09-23 19:54:09,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-23 19:54:09,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-23 19:54:09,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-23 19:54:09,391 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-09-23 19:54:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:09,836 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-09-23 19:54:09,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-23 19:54:09,837 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-09-23 19:54:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:09,838 INFO L225 Difference]: With dead ends: 287 [2018-09-23 19:54:09,838 INFO L226 Difference]: Without dead ends: 286 [2018-09-23 19:54:09,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-23 19:54:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-23 19:54:09,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-09-23 19:54:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-23 19:54:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-09-23 19:54:09,844 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-09-23 19:54:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:09,845 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-09-23 19:54:09,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-23 19:54:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-09-23 19:54:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-23 19:54:09,846 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:09,846 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-09-23 19:54:09,847 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:09,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-09-23 19:54:09,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:09,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:09,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:09,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:09,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:12,510 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:12,510 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:12,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:54:12,598 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:54:12,599 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:12,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:12,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:12,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:12,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:12,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:15,552 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:15,553 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-09-23 19:54:15,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-23 19:54:15,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-23 19:54:15,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-23 19:54:15,554 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-09-23 19:54:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:16,123 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-23 19:54:16,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-23 19:54:16,124 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-09-23 19:54:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:16,126 INFO L225 Difference]: With dead ends: 291 [2018-09-23 19:54:16,126 INFO L226 Difference]: Without dead ends: 290 [2018-09-23 19:54:16,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-23 19:54:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-23 19:54:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-09-23 19:54:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-23 19:54:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-09-23 19:54:16,131 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-09-23 19:54:16,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:16,131 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-09-23 19:54:16,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-23 19:54:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-09-23 19:54:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-23 19:54:16,132 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:16,132 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-09-23 19:54:16,133 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:16,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:16,133 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-09-23 19:54:16,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:16,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:16,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:16,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:16,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:18,911 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:18,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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:18,918 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:54:19,136 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-09-23 19:54:19,136 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:19,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:19,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:19,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:19,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:19,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:22,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:22,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-09-23 19:54:22,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-23 19:54:22,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-23 19:54:22,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-23 19:54:22,167 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-09-23 19:54:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:22,772 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-23 19:54:22,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-23 19:54:22,772 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-09-23 19:54:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:22,774 INFO L225 Difference]: With dead ends: 295 [2018-09-23 19:54:22,774 INFO L226 Difference]: Without dead ends: 294 [2018-09-23 19:54:22,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-23 19:54:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-23 19:54:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-09-23 19:54:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-23 19:54:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-09-23 19:54:22,780 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-09-23 19:54:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:22,780 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-09-23 19:54:22,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-23 19:54:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-09-23 19:54:22,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-23 19:54:22,781 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:22,782 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-09-23 19:54:22,782 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:22,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-09-23 19:54:22,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:22,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:22,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:25,367 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:25,367 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:25,375 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:54:25,676 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-09-23 19:54:25,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:25,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:25,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:25,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:25,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:25,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:28,938 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:28,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-09-23 19:54:28,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-23 19:54:28,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-23 19:54:28,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-23 19:54:28,940 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-09-23 19:54:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:29,413 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-09-23 19:54:29,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-23 19:54:29,414 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-09-23 19:54:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:29,415 INFO L225 Difference]: With dead ends: 299 [2018-09-23 19:54:29,416 INFO L226 Difference]: Without dead ends: 298 [2018-09-23 19:54:29,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-23 19:54:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-23 19:54:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-09-23 19:54:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-23 19:54:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-23 19:54:29,421 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-09-23 19:54:29,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:29,421 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-23 19:54:29,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-23 19:54:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-23 19:54:29,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-23 19:54:29,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:29,422 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-09-23 19:54:29,422 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:29,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:29,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-09-23 19:54:29,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:29,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:29,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:29,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:29,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:32,236 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:32,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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:32,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:54:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:32,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:32,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:32,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:32,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:32,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:35,610 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:35,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-09-23 19:54:35,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-23 19:54:35,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-23 19:54:35,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-23 19:54:35,612 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-09-23 19:54:36,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:36,062 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-09-23 19:54:36,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-23 19:54:36,062 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-09-23 19:54:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:36,064 INFO L225 Difference]: With dead ends: 303 [2018-09-23 19:54:36,064 INFO L226 Difference]: Without dead ends: 302 [2018-09-23 19:54:36,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-23 19:54:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-23 19:54:36,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-09-23 19:54:36,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-23 19:54:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-23 19:54:36,070 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-09-23 19:54:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:36,070 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-23 19:54:36,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-23 19:54:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-23 19:54:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-23 19:54:36,071 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:36,071 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-09-23 19:54:36,071 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:36,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:36,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-09-23 19:54:36,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:36,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:36,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:36,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:54:36,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:38,808 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:38,808 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:38,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:54:38,887 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:54:38,887 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:38,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:38,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:38,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:38,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:38,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:42,177 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:42,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-09-23 19:54:42,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-23 19:54:42,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-23 19:54:42,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-23 19:54:42,179 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-09-23 19:54:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:42,663 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-09-23 19:54:42,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-23 19:54:42,663 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-09-23 19:54:42,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:42,665 INFO L225 Difference]: With dead ends: 307 [2018-09-23 19:54:42,665 INFO L226 Difference]: Without dead ends: 306 [2018-09-23 19:54:42,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-23 19:54:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-23 19:54:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-09-23 19:54:42,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-23 19:54:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-09-23 19:54:42,671 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-09-23 19:54:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:42,671 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-09-23 19:54:42,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-23 19:54:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-09-23 19:54:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-23 19:54:42,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:42,673 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-09-23 19:54:42,673 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:42,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:42,673 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-09-23 19:54:42,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:42,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:42,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:42,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:42,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:45,436 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:45,436 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:45,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:54:45,867 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-09-23 19:54:45,867 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:45,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:45,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:45,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:45,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:45,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 19:54:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:49,204 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:54:49,205 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2018-09-23 19:54:49,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-23 19:54:49,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-23 19:54:49,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-23 19:54:49,207 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2018-09-23 19:54:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:54:49,725 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-09-23 19:54:49,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-23 19:54:49,725 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2018-09-23 19:54:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:54:49,727 INFO L225 Difference]: With dead ends: 311 [2018-09-23 19:54:49,727 INFO L226 Difference]: Without dead ends: 310 [2018-09-23 19:54:49,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-23 19:54:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-23 19:54:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-09-23 19:54:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-09-23 19:54:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-09-23 19:54:49,732 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2018-09-23 19:54:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:54:49,733 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-09-23 19:54:49,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-23 19:54:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-09-23 19:54:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-23 19:54:49,734 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:54:49,734 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2018-09-23 19:54:49,734 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:54:49,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:54:49,734 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2018-09-23 19:54:49,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:54:49,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:54:49,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:49,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:54:49,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:54:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:54:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:54:52,503 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:54:52,503 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:52,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:54:52,597 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:54:52,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:54:52,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:54:52,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:54:52,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:54:52,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:54:52,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 Received shutdown request... [2018-09-23 19:54:54,684 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-23 19:54:54,885 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:54:54,885 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-23 19:54:54,891 WARN L206 ceAbstractionStarter]: Timeout [2018-09-23 19:54:54,891 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:54:54 BoogieIcfgContainer [2018-09-23 19:54:54,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:54:54,892 INFO L168 Benchmark]: Toolchain (without parser) took 240484.03 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -293.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-23 19:54:54,893 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:54:54,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:54:54,894 INFO L168 Benchmark]: Boogie Preprocessor took 24.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:54:54,894 INFO L168 Benchmark]: RCFGBuilder took 322.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-23 19:54:54,895 INFO L168 Benchmark]: TraceAbstraction took 240063.10 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -314.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-23 19:54:54,896 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.74 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 24.34 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 322.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240063.10 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -314.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 309 with TraceHistMax 77, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 139 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 239.9s OverallTime, 77 OverallIterations, 77 TraceHistogramMax, 23.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 4233 SDslu, 4298 SDs, 0 SdLazy, 16000 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14551 GetRequests, 8700 SyntacticMatches, 0 SemanticMatches, 5851 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292600 ImplicationChecksByTransitivity, 183.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 76 MinimizatonAttempts, 76 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 8.3s SatisfiabilityAnalysisTime, 196.0s InterpolantComputationTime, 23404 NumberOfCodeBlocks, 23404 NumberOfCodeBlocksAsserted, 1607 NumberOfCheckSat, 23253 ConstructedInterpolants, 0 QuantifiedInterpolants, 37828463 SizeOfPredicates, 450 NumberOfNonLiveVariables, 21675 ConjunctsInSsa, 9300 ConjunctsInUnsatCore, 151 InterpolantComputations, 1 PerfectInterpolantSequences, 0/579500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-54-54-906.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-54-54-906.csv Completed graceful shutdown