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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:34:32,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:34:32,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:34:32,334 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:34:32,335 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:34:32,336 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:34:32,337 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:34:32,339 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:34:32,341 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:34:32,342 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:34:32,343 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:34:32,343 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:34:32,344 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:34:32,345 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:34:32,346 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:34:32,347 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:34:32,348 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:34:32,350 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:34:32,352 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:34:32,354 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:34:32,355 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:34:32,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:34:32,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:34:32,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:34:32,360 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:34:32,361 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:34:32,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:34:32,366 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:34:32,367 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:34:32,368 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:34:32,371 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:34:32,372 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:34:32,373 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:34:32,373 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:34:32,374 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:34:32,377 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:34:32,377 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 10:34:32,408 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:34:32,409 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:34:32,411 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:34:32,412 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:34:32,412 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:34:32,412 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:34:32,413 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:34:32,413 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:34:32,413 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:34:32,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:34:32,413 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:34:32,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:34:32,414 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:34:32,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:34:32,414 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:34:32,414 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:34:32,415 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:34:32,415 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:34:32,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:34:32,415 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:34:32,415 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:34:32,416 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:34:32,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:34:32,416 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:34:32,416 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:34:32,416 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:34:32,417 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:34:32,417 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:34:32,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:34:32,417 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:34:32,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:34:32,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:34:32,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:34:32,486 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:34:32,487 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:34:32,487 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2018-09-30 10:34:32,488 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2018-09-30 10:34:32,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:34:32,552 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:34:32,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:34:32,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:34:32,554 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:34:32,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:32" (1/1) ... [2018-09-30 10:34:32,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:32" (1/1) ... [2018-09-30 10:34:32,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:34:32,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:34:32,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:34:32,616 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:34:32,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:32" (1/1) ... [2018-09-30 10:34:32,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:32" (1/1) ... [2018-09-30 10:34:32,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:32" (1/1) ... [2018-09-30 10:34:32,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:32" (1/1) ... [2018-09-30 10:34:32,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:32" (1/1) ... [2018-09-30 10:34:32,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:32" (1/1) ... [2018-09-30 10:34:32,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:32" (1/1) ... [2018-09-30 10:34:32,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:34:32,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:34:32,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:34:32,645 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:34:32,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:34:32,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:34:32,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:34:33,171 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:34:33,172 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:34:33 BoogieIcfgContainer [2018-09-30 10:34:33,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:34:33,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:34:33,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:34:33,184 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:34:33,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:32" (1/2) ... [2018-09-30 10:34:33,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f8b442 and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:34:33, skipping insertion in model container [2018-09-30 10:34:33,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:34:33" (2/2) ... [2018-09-30 10:34:33,188 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2018-09-30 10:34:33,198 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:34:33,207 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-30 10:34:33,276 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:34:33,276 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:34:33,277 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:34:33,277 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:34:33,277 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:34:33,277 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:34:33,277 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:34:33,278 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:34:33,278 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:34:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-09-30 10:34:33,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:34:33,305 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:33,306 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:34:33,308 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:33,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2018-09-30 10:34:33,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:33,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:33,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:33,545 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:34:33,546 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:34:33,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:34:33,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:34:33,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:34:33,563 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2018-09-30 10:34:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:33,647 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-09-30 10:34:33,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:34:33,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-09-30 10:34:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:33,662 INFO L225 Difference]: With dead ends: 24 [2018-09-30 10:34:33,662 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 10:34:33,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:34:33,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 10:34:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-09-30 10:34:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-30 10:34:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-09-30 10:34:33,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-09-30 10:34:33,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:33,699 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-09-30 10:34:33,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:34:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-09-30 10:34:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 10:34:33,700 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:33,700 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-30 10:34:33,700 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:33,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2018-09-30 10:34:33,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:33,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:33,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:33,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:33,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:33,995 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:34:33,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:34:33,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:34:33,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:34:33,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:34:33,998 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-09-30 10:34:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:34,219 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-09-30 10:34:34,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:34:34,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-30 10:34:34,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:34,221 INFO L225 Difference]: With dead ends: 18 [2018-09-30 10:34:34,221 INFO L226 Difference]: Without dead ends: 17 [2018-09-30 10:34:34,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:34:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-30 10:34:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-09-30 10:34:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-30 10:34:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-09-30 10:34:34,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2018-09-30 10:34:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:34,229 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-09-30 10:34:34,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:34:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-09-30 10:34:34,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:34:34,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:34,230 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:34:34,231 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:34,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:34,231 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2018-09-30 10:34:34,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:34,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:34,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:34,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:34,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:34,279 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:34:34,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:34:34,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:34:34,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:34:34,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:34:34,281 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2018-09-30 10:34:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:34,303 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-09-30 10:34:34,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:34:34,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-30 10:34:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:34,305 INFO L225 Difference]: With dead ends: 19 [2018-09-30 10:34:34,305 INFO L226 Difference]: Without dead ends: 12 [2018-09-30 10:34:34,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:34:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-30 10:34:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-30 10:34:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-30 10:34:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-30 10:34:34,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-09-30 10:34:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:34,310 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-30 10:34:34,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:34:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-30 10:34:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:34:34,311 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:34,311 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:34:34,312 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:34,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:34,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2018-09-30 10:34:34,312 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:34,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:34,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:34,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:34,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:34,572 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:34,573 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:34,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:34,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:34,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:34,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:34,800 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-30 10:34:34,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:34,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:34,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-09-30 10:34:34,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:34:34,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:34:34,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:34:34,979 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-09-30 10:34:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:35,286 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-30 10:34:35,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:34:35,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-30 10:34:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:35,289 INFO L225 Difference]: With dead ends: 21 [2018-09-30 10:34:35,289 INFO L226 Difference]: Without dead ends: 20 [2018-09-30 10:34:35,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-09-30 10:34:35,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-30 10:34:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-09-30 10:34:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 10:34:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-30 10:34:35,295 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2018-09-30 10:34:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:35,296 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-30 10:34:35,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:34:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-30 10:34:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:34:35,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:35,297 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2018-09-30 10:34:35,297 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:35,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2018-09-30 10:34:35,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:35,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:35,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:35,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:35,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:35,499 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:35,499 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:35,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:34:35,547 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:34:35,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:35,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:35,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:35,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:35,572 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-30 10:34:35,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:35,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:35,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-30 10:34:35,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:34:35,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:34:35,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-09-30 10:34:35,703 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-30 10:34:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:35,986 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-30 10:34:35,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:34:35,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-30 10:34:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:35,988 INFO L225 Difference]: With dead ends: 26 [2018-09-30 10:34:35,988 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 10:34:35,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:34:35,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 10:34:35,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-09-30 10:34:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-30 10:34:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-30 10:34:35,996 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2018-09-30 10:34:35,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:35,996 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-30 10:34:35,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:34:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-30 10:34:35,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:34:35,997 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:35,998 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2018-09-30 10:34:35,998 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:35,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:35,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2018-09-30 10:34:35,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:35,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:36,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:36,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:36,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:36,238 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:36,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:36,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:34:36,333 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-30 10:34:36,333 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:36,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:36,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:36,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:36,450 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-30 10:34:36,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:36,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:36,730 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-09-30 10:34:36,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:34:36,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:34:36,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-09-30 10:34:36,731 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2018-09-30 10:34:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:36,939 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-30 10:34:36,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:34:36,940 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-30 10:34:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:36,941 INFO L225 Difference]: With dead ends: 31 [2018-09-30 10:34:36,941 INFO L226 Difference]: Without dead ends: 30 [2018-09-30 10:34:36,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:34:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-30 10:34:36,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-09-30 10:34:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-30 10:34:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-30 10:34:36,949 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2018-09-30 10:34:36,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:36,950 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-30 10:34:36,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:34:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-30 10:34:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-30 10:34:36,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:36,951 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2018-09-30 10:34:36,951 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:36,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2018-09-30 10:34:36,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:36,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:36,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:36,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:36,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:37,128 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:37,129 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:37,137 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:34:37,183 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:34:37,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:37,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:37,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:37,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:37,218 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-30 10:34:37,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:37,368 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:37,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 10:34:37,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:34:37,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:34:37,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:34:37,370 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-09-30 10:34:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:37,619 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-30 10:34:37,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:34:37,619 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-09-30 10:34:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:37,622 INFO L225 Difference]: With dead ends: 36 [2018-09-30 10:34:37,622 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 10:34:37,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:34:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 10:34:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-09-30 10:34:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-30 10:34:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-30 10:34:37,631 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2018-09-30 10:34:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:37,632 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-30 10:34:37,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:34:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-30 10:34:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-30 10:34:37,633 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:37,633 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2018-09-30 10:34:37,633 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:37,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:37,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2018-09-30 10:34:37,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:37,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:37,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:37,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:37,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:37,793 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:37,793 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:37,800 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:34:37,836 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-30 10:34:37,837 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:37,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:37,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:37,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:37,864 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-30 10:34:37,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:38,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:38,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-30 10:34:38,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:34:38,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:34:38,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:34:38,031 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2018-09-30 10:34:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:38,438 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-30 10:34:38,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:34:38,438 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-09-30 10:34:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:38,439 INFO L225 Difference]: With dead ends: 41 [2018-09-30 10:34:38,439 INFO L226 Difference]: Without dead ends: 40 [2018-09-30 10:34:38,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-09-30 10:34:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-30 10:34:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-09-30 10:34:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 10:34:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-30 10:34:38,447 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2018-09-30 10:34:38,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:38,448 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-30 10:34:38,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:34:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-30 10:34:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 10:34:38,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:38,449 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2018-09-30 10:34:38,450 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:38,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:38,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2018-09-30 10:34:38,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:38,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:38,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:38,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:38,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:39,008 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:39,009 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:39,024 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:34:39,090 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 10:34:39,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:39,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:39,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:39,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:39,126 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-30 10:34:39,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:39,351 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:39,352 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-09-30 10:34:39,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:34:39,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:34:39,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:34:39,353 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2018-09-30 10:34:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:39,789 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-30 10:34:39,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:34:39,792 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-09-30 10:34:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:39,793 INFO L225 Difference]: With dead ends: 46 [2018-09-30 10:34:39,793 INFO L226 Difference]: Without dead ends: 45 [2018-09-30 10:34:39,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2018-09-30 10:34:39,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-30 10:34:39,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-09-30 10:34:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-30 10:34:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-30 10:34:39,803 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2018-09-30 10:34:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:39,803 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-30 10:34:39,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:34:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-30 10:34:39,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 10:34:39,805 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:39,805 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2018-09-30 10:34:39,805 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:39,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:39,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2018-09-30 10:34:39,806 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:39,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:39,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:39,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:39,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:40,007 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:40,007 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:40,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:40,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:40,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:40,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:40,098 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-30 10:34:40,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:40,527 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:40,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-30 10:34:40,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 10:34:40,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 10:34:40,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:34:40,529 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2018-09-30 10:34:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:40,940 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-30 10:34:40,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:34:40,947 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-09-30 10:34:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:40,948 INFO L225 Difference]: With dead ends: 51 [2018-09-30 10:34:40,948 INFO L226 Difference]: Without dead ends: 50 [2018-09-30 10:34:40,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2018-09-30 10:34:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-30 10:34:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-09-30 10:34:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-30 10:34:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-30 10:34:40,958 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2018-09-30 10:34:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:40,958 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-30 10:34:40,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 10:34:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-30 10:34:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-30 10:34:40,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:40,960 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2018-09-30 10:34:40,960 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:40,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:40,961 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2018-09-30 10:34:40,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:40,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:40,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:40,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:40,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:41,205 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:41,205 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:41,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:34:41,263 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:34:41,264 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:41,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:41,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:41,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:41,322 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-30 10:34:41,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:41,581 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:41,581 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-09-30 10:34:41,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 10:34:41,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 10:34:41,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-09-30 10:34:41,582 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2018-09-30 10:34:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:41,986 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-30 10:34:41,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:34:41,987 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-09-30 10:34:41,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:41,988 INFO L225 Difference]: With dead ends: 56 [2018-09-30 10:34:41,988 INFO L226 Difference]: Without dead ends: 55 [2018-09-30 10:34:41,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2018-09-30 10:34:41,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-30 10:34:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-09-30 10:34:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 10:34:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-30 10:34:41,997 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2018-09-30 10:34:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:41,997 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-30 10:34:41,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 10:34:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-30 10:34:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-30 10:34:41,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:41,998 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2018-09-30 10:34:41,999 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:41,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:41,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2018-09-30 10:34:41,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:41,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:42,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:42,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:42,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:42,316 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:42,316 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:42,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:34:42,375 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-30 10:34:42,375 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:42,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:42,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:42,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:42,400 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-30 10:34:42,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:42,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:42,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-09-30 10:34:42,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-30 10:34:42,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-30 10:34:42,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-09-30 10:34:42,766 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2018-09-30 10:34:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:43,175 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-30 10:34:43,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:34:43,176 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-09-30 10:34:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:43,177 INFO L225 Difference]: With dead ends: 61 [2018-09-30 10:34:43,178 INFO L226 Difference]: Without dead ends: 60 [2018-09-30 10:34:43,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 10:34:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-30 10:34:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-09-30 10:34:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-30 10:34:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-30 10:34:43,188 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2018-09-30 10:34:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:43,189 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-30 10:34:43,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-30 10:34:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-30 10:34:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-30 10:34:43,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:43,190 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2018-09-30 10:34:43,190 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:43,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:43,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2018-09-30 10:34:43,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:43,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:43,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:43,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:43,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:43,467 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:43,468 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:43,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:34:43,517 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:34:43,517 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:43,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:43,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:43,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:43,559 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-30 10:34:43,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:43,904 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:43,904 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-09-30 10:34:43,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-30 10:34:43,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-30 10:34:43,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-09-30 10:34:43,906 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-09-30 10:34:44,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:44,358 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-30 10:34:44,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:34:44,359 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-09-30 10:34:44,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:44,360 INFO L225 Difference]: With dead ends: 66 [2018-09-30 10:34:44,360 INFO L226 Difference]: Without dead ends: 65 [2018-09-30 10:34:44,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=467, Invalid=865, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 10:34:44,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-30 10:34:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-09-30 10:34:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-30 10:34:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-30 10:34:44,372 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2018-09-30 10:34:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:44,372 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-30 10:34:44,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-30 10:34:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-30 10:34:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-30 10:34:44,373 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:44,373 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2018-09-30 10:34:44,374 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:44,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:44,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2018-09-30 10:34:44,374 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:44,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:44,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:44,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:44,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:45,378 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:45,378 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:34:45,387 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:34:45,446 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-30 10:34:45,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:45,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:45,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:45,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:45,504 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-30 10:34:45,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:45,798 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:45,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-09-30 10:34:45,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-30 10:34:45,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-30 10:34:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-09-30 10:34:45,800 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2018-09-30 10:34:46,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:46,471 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-30 10:34:46,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:34:46,472 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-09-30 10:34:46,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:46,472 INFO L225 Difference]: With dead ends: 71 [2018-09-30 10:34:46,473 INFO L226 Difference]: Without dead ends: 70 [2018-09-30 10:34:46,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=545, Invalid=1015, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 10:34:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-30 10:34:46,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-09-30 10:34:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 10:34:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-30 10:34:46,487 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2018-09-30 10:34:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:46,487 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-30 10:34:46,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-30 10:34:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-30 10:34:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 10:34:46,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:46,488 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2018-09-30 10:34:46,489 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:46,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:46,489 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2018-09-30 10:34:46,489 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:46,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:46,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:46,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:46,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:46,778 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:46,779 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-30 10:34:46,790 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:34:46,848 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 10:34:46,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:46,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:46,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:46,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:46,892 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-30 10:34:46,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:47,145 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:47,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-09-30 10:34:47,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-30 10:34:47,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-30 10:34:47,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2018-09-30 10:34:47,147 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2018-09-30 10:34:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:47,633 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-30 10:34:47,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:34:47,634 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-09-30 10:34:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:47,635 INFO L225 Difference]: With dead ends: 76 [2018-09-30 10:34:47,635 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 10:34:47,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=629, Invalid=1177, Unknown=0, NotChecked=0, Total=1806 [2018-09-30 10:34:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 10:34:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-09-30 10:34:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-30 10:34:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-30 10:34:47,648 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2018-09-30 10:34:47,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:47,649 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-30 10:34:47,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-30 10:34:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-30 10:34:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-30 10:34:47,650 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:47,650 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2018-09-30 10:34:47,651 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:47,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:47,651 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2018-09-30 10:34:47,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:47,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:47,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:47,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:47,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:48,193 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:48,193 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-30 10:34:48,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:48,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:48,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:48,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:48,316 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-30 10:34:48,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:48,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:48,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-09-30 10:34:48,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-30 10:34:48,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-30 10:34:48,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-09-30 10:34:48,596 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2018-09-30 10:34:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:49,244 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-30 10:34:49,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:34:49,245 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-09-30 10:34:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:49,246 INFO L225 Difference]: With dead ends: 81 [2018-09-30 10:34:49,246 INFO L226 Difference]: Without dead ends: 80 [2018-09-30 10:34:49,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=719, Invalid=1351, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 10:34:49,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-30 10:34:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-09-30 10:34:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-30 10:34:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-30 10:34:49,260 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2018-09-30 10:34:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:49,260 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-30 10:34:49,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-30 10:34:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-30 10:34:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-30 10:34:49,261 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:49,262 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2018-09-30 10:34:49,262 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:49,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:49,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2018-09-30 10:34:49,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:49,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:49,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:49,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:49,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:49,573 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:49,573 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-30 10:34:49,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:34:49,642 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:34:49,643 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:49,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:49,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:49,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:49,666 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-30 10:34:49,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:49,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:49,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-09-30 10:34:49,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-30 10:34:49,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-30 10:34:49,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 10:34:49,993 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2018-09-30 10:34:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:50,593 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-30 10:34:50,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:34:50,595 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2018-09-30 10:34:50,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:50,596 INFO L225 Difference]: With dead ends: 86 [2018-09-30 10:34:50,596 INFO L226 Difference]: Without dead ends: 85 [2018-09-30 10:34:50,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=815, Invalid=1537, Unknown=0, NotChecked=0, Total=2352 [2018-09-30 10:34:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-30 10:34:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-09-30 10:34:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-30 10:34:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-30 10:34:50,608 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2018-09-30 10:34:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:50,608 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-30 10:34:50,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-30 10:34:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-30 10:34:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-30 10:34:50,609 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:50,609 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2018-09-30 10:34:50,609 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:50,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:50,610 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2018-09-30 10:34:50,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:50,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:50,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:50,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:50,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:51,586 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:51,586 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:34:51,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:34:51,687 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-30 10:34:51,687 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:51,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:51,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:51,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:51,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:51,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:52,185 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:52,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-09-30 10:34:52,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-30 10:34:52,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-30 10:34:52,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 10:34:52,186 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2018-09-30 10:34:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:52,888 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-30 10:34:52,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 10:34:52,889 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2018-09-30 10:34:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:52,890 INFO L225 Difference]: With dead ends: 91 [2018-09-30 10:34:52,890 INFO L226 Difference]: Without dead ends: 90 [2018-09-30 10:34:52,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=917, Invalid=1735, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 10:34:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-30 10:34:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-09-30 10:34:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-30 10:34:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-30 10:34:52,905 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2018-09-30 10:34:52,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:52,906 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-30 10:34:52,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-30 10:34:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-30 10:34:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-30 10:34:52,907 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:52,907 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2018-09-30 10:34:52,907 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:52,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:52,912 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2018-09-30 10:34:52,912 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:52,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:52,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:52,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:52,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:53,450 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:53,450 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-30 10:34:53,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:34:53,523 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:34:53,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:53,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:53,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:53,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:53,543 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-30 10:34:53,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:53,919 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:53,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-09-30 10:34:53,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-30 10:34:53,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-30 10:34:53,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 10:34:53,920 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2018-09-30 10:34:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:54,509 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-30 10:34:54,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:34:54,510 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2018-09-30 10:34:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:54,511 INFO L225 Difference]: With dead ends: 96 [2018-09-30 10:34:54,511 INFO L226 Difference]: Without dead ends: 95 [2018-09-30 10:34:54,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1025, Invalid=1945, Unknown=0, NotChecked=0, Total=2970 [2018-09-30 10:34:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-30 10:34:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-09-30 10:34:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-30 10:34:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-30 10:34:54,524 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2018-09-30 10:34:54,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:54,524 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-30 10:34:54,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-30 10:34:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-30 10:34:54,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-30 10:34:54,525 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:54,525 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2018-09-30 10:34:54,525 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:54,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:54,526 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2018-09-30 10:34:54,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:54,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:54,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:54,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:54,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:54,870 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:54,870 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-30 10:34:54,886 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:34:54,974 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-30 10:34:54,974 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:54,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:54,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:54,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:54,988 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-30 10:34:54,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:55,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:55,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-09-30 10:34:55,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-30 10:34:55,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-30 10:34:55,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 10:34:55,339 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2018-09-30 10:34:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:55,956 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-30 10:34:55,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:34:55,956 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2018-09-30 10:34:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:55,957 INFO L225 Difference]: With dead ends: 101 [2018-09-30 10:34:55,957 INFO L226 Difference]: Without dead ends: 100 [2018-09-30 10:34:55,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1139, Invalid=2167, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 10:34:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-30 10:34:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-09-30 10:34:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-30 10:34:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-30 10:34:55,968 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2018-09-30 10:34:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:55,968 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-30 10:34:55,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-30 10:34:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-30 10:34:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-30 10:34:55,969 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:55,969 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2018-09-30 10:34:55,969 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:55,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2018-09-30 10:34:55,970 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:55,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:55,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:55,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:55,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:56,659 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:56,660 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:34:56,667 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:34:56,840 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-30 10:34:56,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:56,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:56,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:56,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:56,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:56,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:57,274 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:57,274 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-09-30 10:34:57,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-30 10:34:57,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-30 10:34:57,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 10:34:57,276 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2018-09-30 10:34:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:57,969 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-30 10:34:57,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:34:57,969 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2018-09-30 10:34:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:57,970 INFO L225 Difference]: With dead ends: 106 [2018-09-30 10:34:57,971 INFO L226 Difference]: Without dead ends: 105 [2018-09-30 10:34:57,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1259, Invalid=2401, Unknown=0, NotChecked=0, Total=3660 [2018-09-30 10:34:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-30 10:34:57,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-09-30 10:34:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-30 10:34:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-30 10:34:57,984 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2018-09-30 10:34:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:57,984 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-30 10:34:57,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-30 10:34:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-30 10:34:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-30 10:34:57,985 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:57,985 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2018-09-30 10:34:57,985 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:57,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:57,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2018-09-30 10:34:57,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:57,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:57,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:57,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:57,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:59,184 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:59,184 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-30 10:34:59,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:59,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:59,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:59,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:59,281 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-30 10:34:59,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:59,680 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:59,681 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-09-30 10:34:59,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-30 10:34:59,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-30 10:34:59,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2018-09-30 10:34:59,682 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2018-09-30 10:35:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:00,380 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-30 10:35:00,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:35:00,382 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2018-09-30 10:35:00,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:00,383 INFO L225 Difference]: With dead ends: 111 [2018-09-30 10:35:00,383 INFO L226 Difference]: Without dead ends: 110 [2018-09-30 10:35:00,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1385, Invalid=2647, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 10:35:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-30 10:35:00,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2018-09-30 10:35:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-30 10:35:00,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-30 10:35:00,398 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2018-09-30 10:35:00,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:00,398 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-30 10:35:00,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-30 10:35:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-30 10:35:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-30 10:35:00,398 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:00,399 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2018-09-30 10:35:00,399 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:00,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:00,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2018-09-30 10:35:00,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:00,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:00,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:00,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:00,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:00,908 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:00,908 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-30 10:35:00,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:35:01,003 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:35:01,004 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:01,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:01,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:01,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:01,106 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-30 10:35:01,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:03,152 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:03,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-09-30 10:35:03,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-30 10:35:03,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-30 10:35:03,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 10:35:03,153 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2018-09-30 10:35:03,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:03,892 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-30 10:35:03,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:35:03,893 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2018-09-30 10:35:03,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:03,894 INFO L225 Difference]: With dead ends: 116 [2018-09-30 10:35:03,894 INFO L226 Difference]: Without dead ends: 115 [2018-09-30 10:35:03,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1517, Invalid=2905, Unknown=0, NotChecked=0, Total=4422 [2018-09-30 10:35:03,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-30 10:35:03,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-09-30 10:35:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-30 10:35:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-09-30 10:35:03,907 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2018-09-30 10:35:03,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:03,908 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-09-30 10:35:03,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-30 10:35:03,908 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-09-30 10:35:03,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-30 10:35:03,909 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:03,909 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2018-09-30 10:35:03,909 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:03,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:03,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2018-09-30 10:35:03,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:03,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:03,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:03,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:03,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:05,443 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:05,444 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-30 10:35:05,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:35:05,574 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-30 10:35:05,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:05,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:05,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:05,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:05,699 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-30 10:35:05,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:06,246 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:06,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-09-30 10:35:06,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-30 10:35:06,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-30 10:35:06,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 10:35:06,248 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2018-09-30 10:35:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:07,235 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-30 10:35:07,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 10:35:07,235 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2018-09-30 10:35:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:07,236 INFO L225 Difference]: With dead ends: 121 [2018-09-30 10:35:07,237 INFO L226 Difference]: Without dead ends: 120 [2018-09-30 10:35:07,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1655, Invalid=3175, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 10:35:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-30 10:35:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-09-30 10:35:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-30 10:35:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-30 10:35:07,256 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2018-09-30 10:35:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:07,256 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-30 10:35:07,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-30 10:35:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-30 10:35:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-30 10:35:07,257 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:07,257 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2018-09-30 10:35:07,258 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:07,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:07,258 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2018-09-30 10:35:07,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:07,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:07,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:07,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:07,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:08,035 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:08,035 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-30 10:35:08,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:35:08,125 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:35:08,126 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:08,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:08,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:08,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:08,144 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-30 10:35:08,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:08,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:08,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-09-30 10:35:08,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 10:35:08,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 10:35:08,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 10:35:08,707 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2018-09-30 10:35:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:09,643 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-30 10:35:09,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:35:09,643 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2018-09-30 10:35:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:09,645 INFO L225 Difference]: With dead ends: 126 [2018-09-30 10:35:09,645 INFO L226 Difference]: Without dead ends: 125 [2018-09-30 10:35:09,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1799, Invalid=3457, Unknown=0, NotChecked=0, Total=5256 [2018-09-30 10:35:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-30 10:35:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-09-30 10:35:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-30 10:35:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-09-30 10:35:09,662 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2018-09-30 10:35:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:09,662 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-09-30 10:35:09,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 10:35:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-09-30 10:35:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-30 10:35:09,663 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:09,663 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2018-09-30 10:35:09,663 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:09,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2018-09-30 10:35:09,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:09,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:09,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:10,144 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:10,144 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:35:10,153 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:35:10,283 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-30 10:35:10,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:10,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:10,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:10,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:10,303 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-30 10:35:10,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:10,900 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:10,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-09-30 10:35:10,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-30 10:35:10,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-30 10:35:10,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 10:35:10,902 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2018-09-30 10:35:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:12,089 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-30 10:35:12,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:35:12,089 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2018-09-30 10:35:12,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:12,090 INFO L225 Difference]: With dead ends: 131 [2018-09-30 10:35:12,090 INFO L226 Difference]: Without dead ends: 130 [2018-09-30 10:35:12,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1949, Invalid=3751, Unknown=0, NotChecked=0, Total=5700 [2018-09-30 10:35:12,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-30 10:35:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-09-30 10:35:12,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-30 10:35:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-30 10:35:12,106 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2018-09-30 10:35:12,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:12,106 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-30 10:35:12,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-30 10:35:12,106 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-30 10:35:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-30 10:35:12,107 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:12,107 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2018-09-30 10:35:12,107 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:12,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:12,107 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2018-09-30 10:35:12,107 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:12,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:12,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:12,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:12,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:12,676 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:12,676 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-30 10:35:12,684 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:35:12,819 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-30 10:35:12,819 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:12,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:12,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:12,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:12,856 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-30 10:35:12,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:13,397 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:13,397 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-09-30 10:35:13,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-30 10:35:13,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-30 10:35:13,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2018-09-30 10:35:13,399 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2018-09-30 10:35:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:14,348 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-09-30 10:35:14,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:35:14,348 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2018-09-30 10:35:14,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:14,350 INFO L225 Difference]: With dead ends: 136 [2018-09-30 10:35:14,350 INFO L226 Difference]: Without dead ends: 135 [2018-09-30 10:35:14,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2105, Invalid=4057, Unknown=0, NotChecked=0, Total=6162 [2018-09-30 10:35:14,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-30 10:35:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-09-30 10:35:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-30 10:35:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-09-30 10:35:14,371 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2018-09-30 10:35:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:14,371 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-09-30 10:35:14,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-30 10:35:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-09-30 10:35:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-30 10:35:14,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:14,372 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2018-09-30 10:35:14,373 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:14,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:14,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2018-09-30 10:35:14,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:14,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:14,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:14,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:14,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:14,917 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:14,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 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-30 10:35:14,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:15,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:15,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:15,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:15,046 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-30 10:35:15,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:15,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:15,686 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:15,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-09-30 10:35:15,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-30 10:35:15,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-30 10:35:15,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1136, Invalid=1944, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 10:35:15,687 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2018-09-30 10:35:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:16,930 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-30 10:35:16,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:35:16,930 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2018-09-30 10:35:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:16,932 INFO L225 Difference]: With dead ends: 141 [2018-09-30 10:35:16,932 INFO L226 Difference]: Without dead ends: 140 [2018-09-30 10:35:16,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2267, Invalid=4375, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 10:35:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-30 10:35:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-09-30 10:35:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-30 10:35:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-30 10:35:16,955 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2018-09-30 10:35:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:16,956 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-30 10:35:16,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-30 10:35:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-30 10:35:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-30 10:35:16,956 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:16,956 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2018-09-30 10:35:16,957 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:16,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:16,957 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2018-09-30 10:35:16,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:16,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:16,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:16,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:16,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:18,154 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:18,154 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-30 10:35:18,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:35:18,247 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:35:18,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:18,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:18,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:18,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:18,359 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-30 10:35:18,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:20,038 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:20,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-09-30 10:35:20,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 10:35:20,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 10:35:20,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1220, Invalid=2086, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 10:35:20,040 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2018-09-30 10:35:21,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:21,207 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-30 10:35:21,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 10:35:21,208 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2018-09-30 10:35:21,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:21,209 INFO L225 Difference]: With dead ends: 146 [2018-09-30 10:35:21,209 INFO L226 Difference]: Without dead ends: 145 [2018-09-30 10:35:21,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2435, Invalid=4705, Unknown=0, NotChecked=0, Total=7140 [2018-09-30 10:35:21,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-30 10:35:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2018-09-30 10:35:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-30 10:35:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-09-30 10:35:21,236 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2018-09-30 10:35:21,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:21,237 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-09-30 10:35:21,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 10:35:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-09-30 10:35:21,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-30 10:35:21,238 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:21,238 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2018-09-30 10:35:21,238 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:21,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:21,238 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2018-09-30 10:35:21,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:21,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:21,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:21,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:21,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:22,126 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:22,126 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:35:22,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:35:22,287 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-30 10:35:22,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:22,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:22,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:22,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:22,312 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-30 10:35:22,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:23,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:23,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-09-30 10:35:23,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-30 10:35:23,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-30 10:35:23,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1307, Invalid=2233, Unknown=0, NotChecked=0, Total=3540 [2018-09-30 10:35:23,047 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2018-09-30 10:35:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:24,215 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-30 10:35:24,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 10:35:24,215 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2018-09-30 10:35:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:24,216 INFO L225 Difference]: With dead ends: 151 [2018-09-30 10:35:24,216 INFO L226 Difference]: Without dead ends: 150 [2018-09-30 10:35:24,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2609, Invalid=5047, Unknown=0, NotChecked=0, Total=7656 [2018-09-30 10:35:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-30 10:35:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-09-30 10:35:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-30 10:35:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-30 10:35:24,244 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2018-09-30 10:35:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:24,245 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-30 10:35:24,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-30 10:35:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-30 10:35:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-30 10:35:24,246 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:24,246 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2018-09-30 10:35:24,246 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:24,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:24,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2018-09-30 10:35:24,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:24,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:24,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:24,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:24,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:24,943 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:24,943 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:35:24,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:35:25,054 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:35:25,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:25,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:25,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:25,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:25,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-30 10:35:25,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:25,909 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:25,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-09-30 10:35:25,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-30 10:35:25,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-30 10:35:25,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=2385, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 10:35:25,910 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2018-09-30 10:35:27,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:27,339 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-09-30 10:35:27,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 10:35:27,340 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2018-09-30 10:35:27,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:27,341 INFO L225 Difference]: With dead ends: 156 [2018-09-30 10:35:27,341 INFO L226 Difference]: Without dead ends: 155 [2018-09-30 10:35:27,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2789, Invalid=5401, Unknown=0, NotChecked=0, Total=8190 [2018-09-30 10:35:27,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-30 10:35:27,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-09-30 10:35:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-30 10:35:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-09-30 10:35:27,361 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2018-09-30 10:35:27,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:27,362 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-09-30 10:35:27,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-30 10:35:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-09-30 10:35:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-30 10:35:27,362 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:27,363 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2018-09-30 10:35:27,363 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:27,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:27,363 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2018-09-30 10:35:27,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:27,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:27,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:27,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:27,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:28,443 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:28,444 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-30 10:35:28,453 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:35:28,607 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-30 10:35:28,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:28,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:28,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:28,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:28,695 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-30 10:35:28,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:29,703 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:29,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-09-30 10:35:29,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-30 10:35:29,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-30 10:35:29,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=2542, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 10:35:29,705 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2018-09-30 10:35:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:30,977 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-30 10:35:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 10:35:30,977 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2018-09-30 10:35:30,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:30,978 INFO L225 Difference]: With dead ends: 161 [2018-09-30 10:35:30,979 INFO L226 Difference]: Without dead ends: 160 [2018-09-30 10:35:30,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2975, Invalid=5767, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 10:35:30,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-30 10:35:31,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2018-09-30 10:35:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-30 10:35:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-30 10:35:31,004 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2018-09-30 10:35:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:31,004 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-30 10:35:31,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-30 10:35:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-30 10:35:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-30 10:35:31,005 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:31,005 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2018-09-30 10:35:31,005 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:31,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:31,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2018-09-30 10:35:31,006 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:31,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:31,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:31,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:31,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:32,229 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:32,229 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-30 10:35:32,237 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:35:32,419 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-30 10:35:32,419 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:32,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:32,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:32,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:32,442 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-30 10:35:32,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:33,381 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:33,382 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-09-30 10:35:33,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-30 10:35:33,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-30 10:35:33,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1586, Invalid=2704, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 10:35:33,383 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2018-09-30 10:35:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:34,735 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-09-30 10:35:34,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 10:35:34,735 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2018-09-30 10:35:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:34,736 INFO L225 Difference]: With dead ends: 166 [2018-09-30 10:35:34,736 INFO L226 Difference]: Without dead ends: 165 [2018-09-30 10:35:34,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3167, Invalid=6145, Unknown=0, NotChecked=0, Total=9312 [2018-09-30 10:35:34,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-30 10:35:34,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2018-09-30 10:35:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-30 10:35:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-09-30 10:35:34,762 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2018-09-30 10:35:34,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:34,763 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-09-30 10:35:34,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-30 10:35:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-09-30 10:35:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-30 10:35:34,764 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:34,764 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2018-09-30 10:35:34,764 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:34,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:34,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2018-09-30 10:35:34,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:34,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:34,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:34,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:34,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:35,602 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:35,602 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-30 10:35:35,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:35,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:35,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:35,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:35,729 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-30 10:35:35,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:36,575 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:36,576 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-09-30 10:35:36,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 10:35:36,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 10:35:36,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=2871, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 10:35:36,578 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2018-09-30 10:35:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:38,622 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-30 10:35:38,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 10:35:38,623 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2018-09-30 10:35:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:38,624 INFO L225 Difference]: With dead ends: 171 [2018-09-30 10:35:38,624 INFO L226 Difference]: Without dead ends: 170 [2018-09-30 10:35:38,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3365, Invalid=6535, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 10:35:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-30 10:35:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2018-09-30 10:35:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-30 10:35:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-30 10:35:38,655 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2018-09-30 10:35:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:38,656 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-30 10:35:38,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 10:35:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-30 10:35:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-30 10:35:38,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:38,657 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2018-09-30 10:35:38,657 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:38,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:38,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2018-09-30 10:35:38,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:38,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:38,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:38,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:38,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:39,422 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:39,422 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:35:39,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:35:39,540 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:35:39,540 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:39,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:39,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-30 10:35:39,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:39,570 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-30 10:35:39,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:40,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:40,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-09-30 10:35:40,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-30 10:35:40,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-30 10:35:40,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1787, Invalid=3043, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 10:35:40,437 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2018-09-30 10:35:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:41,961 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-09-30 10:35:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 10:35:41,961 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2018-09-30 10:35:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:41,962 INFO L225 Difference]: With dead ends: 176 [2018-09-30 10:35:41,962 INFO L226 Difference]: Without dead ends: 175 [2018-09-30 10:35:41,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3569, Invalid=6937, Unknown=0, NotChecked=0, Total=10506 [2018-09-30 10:35:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-30 10:35:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2018-09-30 10:35:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-30 10:35:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-09-30 10:35:41,997 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2018-09-30 10:35:41,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:41,998 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-09-30 10:35:41,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-30 10:35:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-09-30 10:35:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-30 10:35:41,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:41,999 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2018-09-30 10:35:41,999 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:41,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:41,999 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2018-09-30 10:35:42,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:42,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:42,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:42,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:42,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:43,124 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:43,124 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-30 10:35:43,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:35:43,325 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-30 10:35:43,326 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:43,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:43,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:43,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:43,344 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-30 10:35:43,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:44,238 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:44,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-09-30 10:35:44,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-30 10:35:44,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-30 10:35:44,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=3220, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 10:35:44,240 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2018-09-30 10:35:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:45,744 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-09-30 10:35:45,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 10:35:45,744 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2018-09-30 10:35:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:45,745 INFO L225 Difference]: With dead ends: 181 [2018-09-30 10:35:45,745 INFO L226 Difference]: Without dead ends: 180 [2018-09-30 10:35:45,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3779, Invalid=7351, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 10:35:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-30 10:35:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2018-09-30 10:35:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-30 10:35:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-30 10:35:45,777 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2018-09-30 10:35:45,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:45,777 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-30 10:35:45,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-30 10:35:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-30 10:35:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-30 10:35:45,778 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:45,778 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2018-09-30 10:35:45,778 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:45,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:45,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2018-09-30 10:35:45,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:45,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:45,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:45,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:45,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:46,697 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:46,697 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:35:46,704 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:35:46,824 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:35:46,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:46,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:46,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:46,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:46,939 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-30 10:35:46,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:48,204 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:48,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-09-30 10:35:48,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-30 10:35:48,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-30 10:35:48,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2000, Invalid=3402, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 10:35:48,205 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2018-09-30 10:35:48,917 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:35:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:50,413 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-09-30 10:35:50,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 10:35:50,413 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2018-09-30 10:35:50,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:50,414 INFO L225 Difference]: With dead ends: 186 [2018-09-30 10:35:50,414 INFO L226 Difference]: Without dead ends: 185 [2018-09-30 10:35:50,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3995, Invalid=7777, Unknown=0, NotChecked=0, Total=11772 [2018-09-30 10:35:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-30 10:35:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-09-30 10:35:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-30 10:35:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-09-30 10:35:50,454 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2018-09-30 10:35:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:50,454 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-09-30 10:35:50,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-30 10:35:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-09-30 10:35:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-30 10:35:50,455 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:50,456 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2018-09-30 10:35:50,456 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:50,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:50,456 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2018-09-30 10:35:50,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:50,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:50,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:50,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:50,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:51,717 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:51,717 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-30 10:35:51,727 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:35:51,923 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-30 10:35:51,923 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:51,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:51,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:51,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:52,010 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-30 10:35:52,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:53,209 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:53,210 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-09-30 10:35:53,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-30 10:35:53,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-30 10:35:53,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=3589, Unknown=0, NotChecked=0, Total=5700 [2018-09-30 10:35:53,211 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2018-09-30 10:35:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:54,858 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-30 10:35:54,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 10:35:54,859 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2018-09-30 10:35:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:54,860 INFO L225 Difference]: With dead ends: 191 [2018-09-30 10:35:54,860 INFO L226 Difference]: Without dead ends: 190 [2018-09-30 10:35:54,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4217, Invalid=8215, Unknown=0, NotChecked=0, Total=12432 [2018-09-30 10:35:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-30 10:35:54,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-09-30 10:35:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-30 10:35:54,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-09-30 10:35:54,890 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2018-09-30 10:35:54,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:54,890 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-09-30 10:35:54,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-30 10:35:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-09-30 10:35:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-30 10:35:54,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:54,891 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2018-09-30 10:35:54,892 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:54,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:54,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2018-09-30 10:35:54,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:54,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:54,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:54,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:54,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:55,944 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:55,944 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-30 10:35:55,952 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:35:56,191 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-30 10:35:56,191 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:56,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:56,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:56,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:56,308 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-30 10:35:56,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:58,592 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:58,592 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-09-30 10:35:58,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-30 10:35:58,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-30 10:35:58,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2225, Invalid=3781, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 10:35:58,593 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2018-09-30 10:36:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:00,276 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-09-30 10:36:00,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 10:36:00,276 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2018-09-30 10:36:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:00,277 INFO L225 Difference]: With dead ends: 196 [2018-09-30 10:36:00,277 INFO L226 Difference]: Without dead ends: 195 [2018-09-30 10:36:00,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4445, Invalid=8665, Unknown=0, NotChecked=0, Total=13110 [2018-09-30 10:36:00,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-30 10:36:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-09-30 10:36:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-09-30 10:36:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-09-30 10:36:00,317 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2018-09-30 10:36:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:00,318 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-09-30 10:36:00,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-30 10:36:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-09-30 10:36:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-30 10:36:00,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:00,319 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2018-09-30 10:36:00,319 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:00,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:00,319 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2018-09-30 10:36:00,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:00,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:00,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:00,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:00,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:01,363 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:01,363 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-30 10:36:01,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:36:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:01,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:01,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:01,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:01,523 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-30 10:36:01,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:02,669 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:02,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-09-30 10:36:02,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-30 10:36:02,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-30 10:36:02,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2342, Invalid=3978, Unknown=0, NotChecked=0, Total=6320 [2018-09-30 10:36:02,670 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2018-09-30 10:36:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:04,580 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-09-30 10:36:04,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 10:36:04,581 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2018-09-30 10:36:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:04,582 INFO L225 Difference]: With dead ends: 201 [2018-09-30 10:36:04,582 INFO L226 Difference]: Without dead ends: 200 [2018-09-30 10:36:04,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4679, Invalid=9127, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 10:36:04,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-30 10:36:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-09-30 10:36:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-30 10:36:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-30 10:36:04,614 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2018-09-30 10:36:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:04,614 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-30 10:36:04,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-30 10:36:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-30 10:36:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-30 10:36:04,615 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:04,615 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2018-09-30 10:36:04,615 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:04,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:04,616 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2018-09-30 10:36:04,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:04,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:04,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:04,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:36:04,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:06,080 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:06,080 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-30 10:36:06,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:36:06,230 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:36:06,230 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:06,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:06,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:06,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:06,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:36:06,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:07,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:07,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-09-30 10:36:07,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-30 10:36:07,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-30 10:36:07,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2462, Invalid=4180, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 10:36:07,423 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2018-09-30 10:36:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:09,546 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-09-30 10:36:09,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 10:36:09,547 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2018-09-30 10:36:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:09,548 INFO L225 Difference]: With dead ends: 206 [2018-09-30 10:36:09,548 INFO L226 Difference]: Without dead ends: 205 [2018-09-30 10:36:09,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4919, Invalid=9601, Unknown=0, NotChecked=0, Total=14520 [2018-09-30 10:36:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-30 10:36:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2018-09-30 10:36:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-30 10:36:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-09-30 10:36:09,583 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2018-09-30 10:36:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:09,583 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-09-30 10:36:09,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-30 10:36:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-09-30 10:36:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-30 10:36:09,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:09,584 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2018-09-30 10:36:09,584 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:09,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:09,585 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2018-09-30 10:36:09,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:09,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:09,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:09,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:09,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:10,972 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:10,973 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-30 10:36:10,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:36:11,263 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-30 10:36:11,263 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:11,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:11,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:11,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:11,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:36:11,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:12,415 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:12,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-09-30 10:36:12,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-30 10:36:12,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-30 10:36:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2585, Invalid=4387, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 10:36:12,417 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2018-09-30 10:36:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:14,547 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-30 10:36:14,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 10:36:14,547 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2018-09-30 10:36:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:14,548 INFO L225 Difference]: With dead ends: 211 [2018-09-30 10:36:14,548 INFO L226 Difference]: Without dead ends: 210 [2018-09-30 10:36:14,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5165, Invalid=10087, Unknown=0, NotChecked=0, Total=15252 [2018-09-30 10:36:14,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-30 10:36:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-09-30 10:36:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-30 10:36:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-09-30 10:36:14,583 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2018-09-30 10:36:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:14,583 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-09-30 10:36:14,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-30 10:36:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-09-30 10:36:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-30 10:36:14,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:14,584 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2018-09-30 10:36:14,584 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:14,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:14,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2018-09-30 10:36:14,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:14,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:14,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:14,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:14,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:15,721 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:15,721 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-30 10:36:15,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:36:15,889 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:36:15,890 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:15,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:15,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:15,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:15,997 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-30 10:36:15,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:17,260 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:17,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-09-30 10:36:17,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-30 10:36:17,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-30 10:36:17,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=4599, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 10:36:17,262 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2018-09-30 10:36:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:19,391 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-09-30 10:36:19,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 10:36:19,392 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2018-09-30 10:36:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:19,393 INFO L225 Difference]: With dead ends: 216 [2018-09-30 10:36:19,393 INFO L226 Difference]: Without dead ends: 215 [2018-09-30 10:36:19,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5417, Invalid=10585, Unknown=0, NotChecked=0, Total=16002 [2018-09-30 10:36:19,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-30 10:36:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2018-09-30 10:36:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-09-30 10:36:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-09-30 10:36:19,431 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2018-09-30 10:36:19,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:19,432 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-09-30 10:36:19,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-30 10:36:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-09-30 10:36:19,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-30 10:36:19,433 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:19,433 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2018-09-30 10:36:19,433 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:19,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:19,433 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2018-09-30 10:36:19,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:19,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:19,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:19,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:19,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:21,260 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:21,260 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-30 10:36:21,268 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:36:21,515 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-30 10:36:21,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:21,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:21,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:21,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:21,550 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-30 10:36:21,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:22,892 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:22,892 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-09-30 10:36:22,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-30 10:36:22,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-30 10:36:22,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2840, Invalid=4816, Unknown=0, NotChecked=0, Total=7656 [2018-09-30 10:36:22,894 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2018-09-30 10:36:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:25,163 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-09-30 10:36:25,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-30 10:36:25,163 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2018-09-30 10:36:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:25,164 INFO L225 Difference]: With dead ends: 221 [2018-09-30 10:36:25,164 INFO L226 Difference]: Without dead ends: 220 [2018-09-30 10:36:25,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5675, Invalid=11095, Unknown=0, NotChecked=0, Total=16770 [2018-09-30 10:36:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-30 10:36:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-09-30 10:36:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-30 10:36:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-30 10:36:25,202 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2018-09-30 10:36:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:25,203 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-30 10:36:25,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-30 10:36:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-30 10:36:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-30 10:36:25,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:25,204 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2018-09-30 10:36:25,204 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:25,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:25,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2018-09-30 10:36:25,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:25,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:25,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:25,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:25,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:26,635 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:26,635 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-30 10:36:26,643 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:36:26,922 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-30 10:36:26,923 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:26,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:26,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:26,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:26,942 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-30 10:36:26,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:28,255 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:28,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-09-30 10:36:28,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-30 10:36:28,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-30 10:36:28,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=5038, Unknown=0, NotChecked=0, Total=8010 [2018-09-30 10:36:28,257 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2018-09-30 10:36:30,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:30,551 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-09-30 10:36:30,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 10:36:30,551 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2018-09-30 10:36:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:30,552 INFO L225 Difference]: With dead ends: 226 [2018-09-30 10:36:30,552 INFO L226 Difference]: Without dead ends: 225 [2018-09-30 10:36:30,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5939, Invalid=11617, Unknown=0, NotChecked=0, Total=17556 [2018-09-30 10:36:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-30 10:36:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-09-30 10:36:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-30 10:36:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-09-30 10:36:30,594 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2018-09-30 10:36:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:30,594 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-09-30 10:36:30,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-30 10:36:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-09-30 10:36:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-30 10:36:30,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:30,596 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2018-09-30 10:36:30,596 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:30,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:30,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2018-09-30 10:36:30,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:30,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:30,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:30,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:30,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:31,941 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:31,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 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-30 10:36:31,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:36:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:32,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:32,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:32,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:32,123 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-30 10:36:32,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:34,355 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:34,355 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-09-30 10:36:34,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-30 10:36:34,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-30 10:36:34,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3107, Invalid=5265, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 10:36:34,356 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2018-09-30 10:36:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:36,668 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-30 10:36:36,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 10:36:36,668 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2018-09-30 10:36:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:36,669 INFO L225 Difference]: With dead ends: 231 [2018-09-30 10:36:36,669 INFO L226 Difference]: Without dead ends: 230 [2018-09-30 10:36:36,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6209, Invalid=12151, Unknown=0, NotChecked=0, Total=18360 [2018-09-30 10:36:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-30 10:36:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-09-30 10:36:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-30 10:36:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-09-30 10:36:36,726 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2018-09-30 10:36:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:36,726 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-09-30 10:36:36,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-30 10:36:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-09-30 10:36:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-30 10:36:36,728 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:36,728 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2018-09-30 10:36:36,728 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:36,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:36,729 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2018-09-30 10:36:36,729 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:36,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:36,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:36,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:36:36,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:38,188 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:38,188 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-30 10:36:38,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:36:38,348 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:36:38,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:38,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:38,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:38,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:38,366 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-30 10:36:38,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:39,979 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:39,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-09-30 10:36:39,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-30 10:36:39,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-30 10:36:39,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=5497, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 10:36:39,981 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2018-09-30 10:36:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:42,374 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-09-30 10:36:42,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 10:36:42,375 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2018-09-30 10:36:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:42,376 INFO L225 Difference]: With dead ends: 236 [2018-09-30 10:36:42,376 INFO L226 Difference]: Without dead ends: 235 [2018-09-30 10:36:42,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6070 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6485, Invalid=12697, Unknown=0, NotChecked=0, Total=19182 [2018-09-30 10:36:42,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-30 10:36:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-09-30 10:36:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-09-30 10:36:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-09-30 10:36:42,436 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2018-09-30 10:36:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:42,437 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-09-30 10:36:42,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-30 10:36:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-09-30 10:36:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-30 10:36:42,439 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:42,439 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2018-09-30 10:36:42,439 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:42,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2018-09-30 10:36:42,440 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:42,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:42,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:42,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:42,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:44,270 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:44,270 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:36:44,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:36:44,597 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-30 10:36:44,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:44,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:44,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:44,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:44,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-30 10:36:44,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:46,275 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:46,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-09-30 10:36:46,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-30 10:36:46,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-30 10:36:46,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3386, Invalid=5734, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 10:36:46,277 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2018-09-30 10:36:48,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:48,947 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-09-30 10:36:48,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 10:36:48,947 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2018-09-30 10:36:48,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:48,949 INFO L225 Difference]: With dead ends: 241 [2018-09-30 10:36:48,949 INFO L226 Difference]: Without dead ends: 240 [2018-09-30 10:36:48,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6767, Invalid=13255, Unknown=0, NotChecked=0, Total=20022 [2018-09-30 10:36:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-09-30 10:36:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2018-09-30 10:36:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-30 10:36:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-30 10:36:49,008 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2018-09-30 10:36:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:49,009 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-30 10:36:49,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-30 10:36:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-30 10:36:49,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-30 10:36:49,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:49,010 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2018-09-30 10:36:49,010 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:49,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:49,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2018-09-30 10:36:49,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:49,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:49,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:50,615 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:50,615 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-30 10:36:50,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:36:50,792 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:36:50,792 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:50,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:50,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:50,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:50,842 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-30 10:36:50,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:52,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:52,483 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-09-30 10:36:52,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-30 10:36:52,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-30 10:36:52,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3530, Invalid=5976, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 10:36:52,485 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2018-09-30 10:36:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:55,300 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-09-30 10:36:55,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 10:36:55,300 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2018-09-30 10:36:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:55,301 INFO L225 Difference]: With dead ends: 246 [2018-09-30 10:36:55,301 INFO L226 Difference]: Without dead ends: 245 [2018-09-30 10:36:55,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7055, Invalid=13825, Unknown=0, NotChecked=0, Total=20880 [2018-09-30 10:36:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-30 10:36:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2018-09-30 10:36:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-09-30 10:36:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-09-30 10:36:55,348 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2018-09-30 10:36:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:55,348 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-09-30 10:36:55,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-30 10:36:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-09-30 10:36:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-30 10:36:55,349 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:55,350 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2018-09-30 10:36:55,350 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:55,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2018-09-30 10:36:55,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:55,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:55,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:56,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:56,801 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:56,801 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-30 10:36:56,809 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:36:57,076 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-30 10:36:57,076 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:57,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:57,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:57,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:57,100 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-30 10:36:57,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:58,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:58,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-09-30 10:36:58,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 10:36:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 10:36:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3677, Invalid=6223, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 10:36:58,737 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2018-09-30 10:37:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:01,543 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-30 10:37:01,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 10:37:01,544 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2018-09-30 10:37:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:01,545 INFO L225 Difference]: With dead ends: 251 [2018-09-30 10:37:01,545 INFO L226 Difference]: Without dead ends: 250 [2018-09-30 10:37:01,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7349, Invalid=14407, Unknown=0, NotChecked=0, Total=21756 [2018-09-30 10:37:01,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-30 10:37:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2018-09-30 10:37:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-09-30 10:37:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-09-30 10:37:01,599 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2018-09-30 10:37:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:01,599 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-09-30 10:37:01,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 10:37:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-09-30 10:37:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-30 10:37:01,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:01,600 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2018-09-30 10:37:01,601 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:01,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2018-09-30 10:37:01,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:01,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:01,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:01,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:01,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:02,972 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:02,972 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:37:02,980 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:37:03,327 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-30 10:37:03,328 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:03,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:03,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:03,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:03,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:37:03,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:05,534 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:05,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-09-30 10:37:05,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-30 10:37:05,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-30 10:37:05,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3827, Invalid=6475, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 10:37:05,536 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2018-09-30 10:37:08,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:08,251 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-09-30 10:37:08,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 10:37:08,252 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2018-09-30 10:37:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:08,253 INFO L225 Difference]: With dead ends: 256 [2018-09-30 10:37:08,253 INFO L226 Difference]: Without dead ends: 255 [2018-09-30 10:37:08,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7649, Invalid=15001, Unknown=0, NotChecked=0, Total=22650 [2018-09-30 10:37:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-30 10:37:08,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2018-09-30 10:37:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-09-30 10:37:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-09-30 10:37:08,306 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2018-09-30 10:37:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:08,306 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-09-30 10:37:08,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-30 10:37:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-09-30 10:37:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-09-30 10:37:08,308 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:08,308 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2018-09-30 10:37:08,308 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:08,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:08,309 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2018-09-30 10:37:08,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:08,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:08,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:08,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:08,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:10,067 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:10,067 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-30 10:37:10,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:37:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:10,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:10,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:10,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:10,262 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-30 10:37:10,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:12,070 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:12,071 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-09-30 10:37:12,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-30 10:37:12,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-30 10:37:12,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3980, Invalid=6732, Unknown=0, NotChecked=0, Total=10712 [2018-09-30 10:37:12,073 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2018-09-30 10:37:15,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:15,076 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-09-30 10:37:15,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 10:37:15,076 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2018-09-30 10:37:15,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:15,077 INFO L225 Difference]: With dead ends: 261 [2018-09-30 10:37:15,077 INFO L226 Difference]: Without dead ends: 260 [2018-09-30 10:37:15,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7955, Invalid=15607, Unknown=0, NotChecked=0, Total=23562 [2018-09-30 10:37:15,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-09-30 10:37:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2018-09-30 10:37:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-30 10:37:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-30 10:37:15,143 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2018-09-30 10:37:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:15,143 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-30 10:37:15,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-30 10:37:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-30 10:37:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-30 10:37:15,145 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:15,145 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2018-09-30 10:37:15,145 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:15,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:15,146 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2018-09-30 10:37:15,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:15,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:15,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:15,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:37:15,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:16,604 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:16,604 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-30 10:37:16,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:37:16,804 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:37:16,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:16,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:16,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:16,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:16,826 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-30 10:37:16,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:18,722 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:18,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 105 [2018-09-30 10:37:18,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-30 10:37:18,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-30 10:37:18,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4136, Invalid=6994, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 10:37:18,725 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2018-09-30 10:37:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:21,891 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-09-30 10:37:21,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 10:37:21,892 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2018-09-30 10:37:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:21,893 INFO L225 Difference]: With dead ends: 266 [2018-09-30 10:37:21,893 INFO L226 Difference]: Without dead ends: 265 [2018-09-30 10:37:21,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8267, Invalid=16225, Unknown=0, NotChecked=0, Total=24492 [2018-09-30 10:37:21,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-30 10:37:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2018-09-30 10:37:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-09-30 10:37:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-09-30 10:37:21,948 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2018-09-30 10:37:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:21,948 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-09-30 10:37:21,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-30 10:37:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-09-30 10:37:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-30 10:37:21,950 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:21,950 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2018-09-30 10:37:21,950 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:21,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2018-09-30 10:37:21,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:21,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:21,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:21,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:21,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:23,501 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:23,502 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-30 10:37:23,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:37:23,913 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-30 10:37:23,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:23,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:23,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:23,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:23,935 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-30 10:37:23,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:26,047 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:26,047 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 107 [2018-09-30 10:37:26,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-30 10:37:26,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-30 10:37:26,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4295, Invalid=7261, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 10:37:26,049 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2018-09-30 10:37:29,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:29,074 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-30 10:37:29,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 10:37:29,074 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2018-09-30 10:37:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:29,075 INFO L225 Difference]: With dead ends: 271 [2018-09-30 10:37:29,075 INFO L226 Difference]: Without dead ends: 270 [2018-09-30 10:37:29,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8107 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8585, Invalid=16855, Unknown=0, NotChecked=0, Total=25440 [2018-09-30 10:37:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-30 10:37:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2018-09-30 10:37:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-30 10:37:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-09-30 10:37:29,131 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2018-09-30 10:37:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:29,132 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-09-30 10:37:29,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-30 10:37:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-09-30 10:37:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-30 10:37:29,133 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:29,133 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2018-09-30 10:37:29,133 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:29,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2018-09-30 10:37:29,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:29,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:29,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:30,987 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:30,987 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-30 10:37:30,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:37:31,180 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:37:31,180 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:31,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:31,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:31,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:31,202 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-30 10:37:31,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:33,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:33,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 109 [2018-09-30 10:37:33,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-30 10:37:33,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-30 10:37:33,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4457, Invalid=7533, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 10:37:33,113 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2018-09-30 10:37:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:36,416 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-09-30 10:37:36,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 10:37:36,416 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2018-09-30 10:37:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:36,417 INFO L225 Difference]: With dead ends: 276 [2018-09-30 10:37:36,417 INFO L226 Difference]: Without dead ends: 275 [2018-09-30 10:37:36,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8909, Invalid=17497, Unknown=0, NotChecked=0, Total=26406 [2018-09-30 10:37:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-30 10:37:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2018-09-30 10:37:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-09-30 10:37:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-09-30 10:37:36,482 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2018-09-30 10:37:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:36,482 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-09-30 10:37:36,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-30 10:37:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-09-30 10:37:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-09-30 10:37:36,484 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:36,484 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2018-09-30 10:37:36,484 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:36,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:36,485 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2018-09-30 10:37:36,485 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:36,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:36,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:36,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:36,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:38,160 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:38,160 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-30 10:37:38,167 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:37:38,519 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-30 10:37:38,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:38,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:38,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:38,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:38,540 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-30 10:37:38,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:40,727 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:40,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 111 [2018-09-30 10:37:40,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-30 10:37:40,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-30 10:37:40,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4622, Invalid=7810, Unknown=0, NotChecked=0, Total=12432 [2018-09-30 10:37:40,730 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2018-09-30 10:37:43,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:43,968 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-09-30 10:37:43,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-30 10:37:43,969 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2018-09-30 10:37:43,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:43,970 INFO L225 Difference]: With dead ends: 281 [2018-09-30 10:37:43,970 INFO L226 Difference]: Without dead ends: 280 [2018-09-30 10:37:43,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8743 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9239, Invalid=18151, Unknown=0, NotChecked=0, Total=27390 [2018-09-30 10:37:43,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-09-30 10:37:44,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2018-09-30 10:37:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-30 10:37:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-30 10:37:44,046 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2018-09-30 10:37:44,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:44,046 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-30 10:37:44,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-30 10:37:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-30 10:37:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-30 10:37:44,048 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:44,048 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2018-09-30 10:37:44,048 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:44,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:44,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2018-09-30 10:37:44,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:44,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:44,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:44,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:44,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:46,041 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:46,041 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-30 10:37:46,048 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:37:46,486 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-30 10:37:46,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:46,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:46,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:46,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:46,506 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-30 10:37:46,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:48,638 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:48,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 113 [2018-09-30 10:37:48,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-30 10:37:48,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-30 10:37:48,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4790, Invalid=8092, Unknown=0, NotChecked=0, Total=12882 [2018-09-30 10:37:48,641 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2018-09-30 10:37:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:51,880 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-09-30 10:37:51,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 10:37:51,881 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2018-09-30 10:37:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:51,882 INFO L225 Difference]: With dead ends: 286 [2018-09-30 10:37:51,882 INFO L226 Difference]: Without dead ends: 285 [2018-09-30 10:37:51,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9070 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9575, Invalid=18817, Unknown=0, NotChecked=0, Total=28392 [2018-09-30 10:37:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-09-30 10:37:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2018-09-30 10:37:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-09-30 10:37:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-09-30 10:37:51,955 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2018-09-30 10:37:51,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:51,955 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-09-30 10:37:51,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-30 10:37:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-09-30 10:37:51,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-09-30 10:37:51,956 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:51,956 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2018-09-30 10:37:51,956 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:51,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:51,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2018-09-30 10:37:51,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:51,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:51,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:51,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:51,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:53,720 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:53,720 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:37:53,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:37:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:53,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:53,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-30 10:37:53,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:53,998 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-30 10:37:53,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:56,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:56,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 115 [2018-09-30 10:37:56,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-30 10:37:56,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-30 10:37:56,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4961, Invalid=8379, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 10:37:56,249 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2018-09-30 10:37:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:59,434 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-30 10:37:59,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-30 10:37:59,434 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2018-09-30 10:37:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:59,435 INFO L225 Difference]: With dead ends: 291 [2018-09-30 10:37:59,435 INFO L226 Difference]: Without dead ends: 290 [2018-09-30 10:37:59,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9917, Invalid=19495, Unknown=0, NotChecked=0, Total=29412 [2018-09-30 10:37:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-30 10:37:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2018-09-30 10:37:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-09-30 10:37:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-09-30 10:37:59,501 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2018-09-30 10:37:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:59,501 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-09-30 10:37:59,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-30 10:37:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-09-30 10:37:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-30 10:37:59,502 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:59,503 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2018-09-30 10:37:59,503 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:59,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:59,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2018-09-30 10:37:59,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:59,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:59,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:59,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:37:59,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:38:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:38:01,403 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:38:01,403 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-30 10:38:01,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:38:01,593 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:38:01,594 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:38:01,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:38:01,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:38:01,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:38:01,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:38:01,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:38:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:38:03,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:38:03,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 117 [2018-09-30 10:38:03,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-30 10:38:03,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-30 10:38:03,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5135, Invalid=8671, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 10:38:03,761 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2018-09-30 10:38:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:38:07,045 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-09-30 10:38:07,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-30 10:38:07,046 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2018-09-30 10:38:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:38:07,047 INFO L225 Difference]: With dead ends: 296 [2018-09-30 10:38:07,047 INFO L226 Difference]: Without dead ends: 295 [2018-09-30 10:38:07,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10265, Invalid=20185, Unknown=0, NotChecked=0, Total=30450 [2018-09-30 10:38:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-09-30 10:38:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2018-09-30 10:38:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-09-30 10:38:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-09-30 10:38:07,123 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2018-09-30 10:38:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:38:07,123 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-09-30 10:38:07,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-30 10:38:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-09-30 10:38:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-09-30 10:38:07,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:38:07,124 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2018-09-30 10:38:07,125 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:38:07,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:38:07,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2018-09-30 10:38:07,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:38:07,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:38:07,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:38:07,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:38:07,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:38:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:38:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:38:08,955 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:38:08,955 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-30 10:38:08,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:38:09,394 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-30 10:38:09,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:38:09,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:38:09,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-30 10:38:09,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:38:09,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-30 10:38:09,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:38:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:38:11,661 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:38:11,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 119 [2018-09-30 10:38:11,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-30 10:38:11,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-30 10:38:11,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5312, Invalid=8968, Unknown=0, NotChecked=0, Total=14280 [2018-09-30 10:38:11,664 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2018-09-30 10:38:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:38:15,093 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-09-30 10:38:15,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-30 10:38:15,094 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2018-09-30 10:38:15,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:38:15,095 INFO L225 Difference]: With dead ends: 301 [2018-09-30 10:38:15,095 INFO L226 Difference]: Without dead ends: 300 [2018-09-30 10:38:15,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10619, Invalid=20887, Unknown=0, NotChecked=0, Total=31506 [2018-09-30 10:38:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-09-30 10:38:15,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2018-09-30 10:38:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-30 10:38:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-30 10:38:15,168 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2018-09-30 10:38:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:38:15,168 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-30 10:38:15,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-30 10:38:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-30 10:38:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-30 10:38:15,170 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:38:15,170 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2018-09-30 10:38:15,170 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:38:15,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:38:15,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2018-09-30 10:38:15,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:38:15,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:38:15,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:38:15,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:38:15,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:38:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:38:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:38:17,034 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:38:17,034 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-30 10:38:17,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:38:17,247 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:38:17,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:38:17,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:38:17,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:38:17,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:38:17,268 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-30 10:38:17,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:38:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:38:19,494 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:38:19,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 121 [2018-09-30 10:38:19,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-30 10:38:19,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-30 10:38:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5492, Invalid=9270, Unknown=0, NotChecked=0, Total=14762 [2018-09-30 10:38:19,496 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2018-09-30 10:38:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:38:22,899 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-09-30 10:38:22,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-30 10:38:22,900 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2018-09-30 10:38:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:38:22,901 INFO L225 Difference]: With dead ends: 306 [2018-09-30 10:38:22,901 INFO L226 Difference]: Without dead ends: 305 [2018-09-30 10:38:22,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10979, Invalid=21601, Unknown=0, NotChecked=0, Total=32580 [2018-09-30 10:38:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-09-30 10:38:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2018-09-30 10:38:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-09-30 10:38:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-09-30 10:38:22,971 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2018-09-30 10:38:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:38:22,971 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-09-30 10:38:22,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-30 10:38:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-09-30 10:38:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-09-30 10:38:22,972 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:38:22,972 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2018-09-30 10:38:22,973 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:38:22,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:38:22,973 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2018-09-30 10:38:22,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:38:22,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:38:22,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:38:22,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:38:22,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:38:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:38:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:38:24,870 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:38:24,870 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-30 10:38:24,877 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:38:25,280 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-30 10:38:25,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:38:25,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:38:25,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:38:25,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:38:25,303 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-30 10:38:25,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:38:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:38:27,627 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:38:27,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 123 [2018-09-30 10:38:27,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-30 10:38:27,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-30 10:38:27,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5675, Invalid=9577, Unknown=0, NotChecked=0, Total=15252 [2018-09-30 10:38:27,629 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. Received shutdown request... [2018-09-30 10:38:30,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-30 10:38:30,911 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:38:30,915 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:38:30,916 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:38:30 BoogieIcfgContainer [2018-09-30 10:38:30,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:38:30,917 INFO L168 Benchmark]: Toolchain (without parser) took 238366.69 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -63.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-09-30 10:38:30,917 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:38:30,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.92 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-30 10:38:30,918 INFO L168 Benchmark]: Boogie Preprocessor took 28.68 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-30 10:38:30,918 INFO L168 Benchmark]: RCFGBuilder took 527.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:38:30,918 INFO L168 Benchmark]: TraceAbstraction took 237742.53 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -85.0 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-09-30 10:38:30,920 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.68 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 527.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237742.53 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -85.0 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (302states) and FLOYD_HOARE automaton (currently 61 states, 124 states before enhancement), while ReachableStatesComputation was computing reachable states (291 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (302states) and FLOYD_HOARE automaton (currently 61 states, 124 states before enhancement), while ReachableStatesComputation was computing reachable states (291 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 2 error locations. TIMEOUT Result, 237.6s OverallTime, 62 OverallIterations, 60 TraceHistogramMax, 96.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 206 SDtfs, 11191 SDslu, 2204 SDs, 0 SdLazy, 16263 SolverSat, 5608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12930 GetRequests, 7320 SyntacticMatches, 0 SemanticMatches, 5610 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220898 ImplicationChecksByTransitivity, 179.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=61, 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: 1.8s AutomataMinimizationTime, 61 MinimizatonAttempts, 182 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.6s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 123.0s InterpolantComputationTime, 18428 NumberOfCodeBlocks, 18428 NumberOfCodeBlocksAsserted, 1031 NumberOfCheckSat, 18307 ConstructedInterpolants, 0 QuantifiedInterpolants, 29560497 SizeOfPredicates, 639 NumberOfNonLiveVariables, 39471 ConjunctsInSsa, 6411 ConjunctsInUnsatCore, 121 InterpolantComputations, 3 PerfectInterpolantSequences, 2/356362 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.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-38-30-928.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-38-30-928.csv Completed graceful shutdown