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_PUPT.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:44:39,249 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:44:39,251 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:44:39,262 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:44:39,262 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:44:39,263 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:44:39,265 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:44:39,268 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:44:39,269 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:44:39,271 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:44:39,272 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:44:39,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:44:39,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:44:39,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:44:39,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:44:39,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:44:39,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:44:39,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:44:39,282 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:44:39,284 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:44:39,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:44:39,286 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:44:39,289 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:44:39,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:44:39,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:44:39,290 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:44:39,291 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:44:39,292 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:44:39,293 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:44:39,294 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:44:39,294 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:44:39,295 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:44:39,295 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:44:39,296 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:44:39,297 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:44:39,297 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:44:39,298 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-26 21:44:39,320 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:44:39,321 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:44:39,322 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:44:39,323 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:44:39,323 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:44:39,323 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:44:39,324 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:44:39,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:44:39,324 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:44:39,324 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:44:39,324 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:44:39,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:44:39,325 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:44:39,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:44:39,325 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:44:39,327 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:44:39,327 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:44:39,327 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:44:39,327 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:44:39,328 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:44:39,328 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:44:39,328 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:44:39,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:44:39,328 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:44:39,329 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:44:39,329 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:44:39,329 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:44:39,329 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:44:39,329 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:44:39,330 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:44:39,330 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:44:39,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:44:39,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:44:39,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:44:39,415 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:44:39,415 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:44:39,416 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-09-26 21:44:39,416 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-09-26 21:44:39,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:44:39,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:44:39,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:44:39,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:44:39,470 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:44:39,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:39" (1/1) ... [2018-09-26 21:44:39,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:39" (1/1) ... [2018-09-26 21:44:39,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:44:39,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:44:39,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:44:39,509 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:44:39,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:39" (1/1) ... [2018-09-26 21:44:39,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:39" (1/1) ... [2018-09-26 21:44:39,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:39" (1/1) ... [2018-09-26 21:44:39,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:39" (1/1) ... [2018-09-26 21:44:39,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:39" (1/1) ... [2018-09-26 21:44:39,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:39" (1/1) ... [2018-09-26 21:44:39,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:39" (1/1) ... [2018-09-26 21:44:39,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:44:39,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:44:39,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:44:39,527 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:44:39,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:39" (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-26 21:44:39,590 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-26 21:44:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:44:39,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:44:39,753 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:44:39,753 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:44:39 BoogieIcfgContainer [2018-09-26 21:44:39,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:44:39,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:44:39,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:44:39,758 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:44:39,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:39" (1/2) ... [2018-09-26 21:44:39,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130e5101 and model type gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:44:39, skipping insertion in model container [2018-09-26 21:44:39,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:44:39" (2/2) ... [2018-09-26 21:44:39,762 INFO L112 eAbstractionObserver]: Analyzing ICFG gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-09-26 21:44:39,773 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:44:39,784 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:44:39,847 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:44:39,848 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:44:39,848 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:44:39,848 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:44:39,848 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:44:39,848 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:44:39,849 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:44:39,849 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:44:39,849 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:44:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-09-26 21:44:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 21:44:39,885 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:39,889 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 21:44:39,890 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:39,899 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:39,899 INFO L82 PathProgramCache]: Analyzing trace with hash 928682, now seen corresponding path program 1 times [2018-09-26 21:44:39,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:39,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:39,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:39,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:39,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:40,063 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-26 21:44:40,065 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:44:40,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:44:40,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:44:40,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:44:40,083 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:40,085 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-09-26 21:44:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:40,332 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2018-09-26 21:44:40,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:44:40,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-26 21:44:40,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:40,344 INFO L225 Difference]: With dead ends: 15 [2018-09-26 21:44:40,344 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 21:44:40,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 21:44:40,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2018-09-26 21:44:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 21:44:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-09-26 21:44:40,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2018-09-26 21:44:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:40,381 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-09-26 21:44:40,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:44:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-09-26 21:44:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 21:44:40,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:40,382 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 21:44:40,383 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:40,383 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash 930604, now seen corresponding path program 1 times [2018-09-26 21:44:40,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:40,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:40,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:40,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:40,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:40,449 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-26 21:44:40,449 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:44:40,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:44:40,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:44:40,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:44:40,452 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:40,452 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-09-26 21:44:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:40,578 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-09-26 21:44:40,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:44:40,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 21:44:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:40,580 INFO L225 Difference]: With dead ends: 11 [2018-09-26 21:44:40,580 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 21:44:40,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 21:44:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 21:44:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 21:44:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-09-26 21:44:40,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 4 [2018-09-26 21:44:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:40,585 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-09-26 21:44:40,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:44:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-09-26 21:44:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:44:40,586 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:40,587 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-26 21:44:40,587 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:40,587 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:40,588 INFO L82 PathProgramCache]: Analyzing trace with hash 487293020, now seen corresponding path program 1 times [2018-09-26 21:44:40,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:40,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:40,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:40,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:40,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:40,699 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:40,699 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-26 21:44:40,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:40,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:40,930 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:40,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-09-26 21:44:40,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:44:40,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:44:40,931 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:40,932 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2018-09-26 21:44:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:41,386 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-09-26 21:44:41,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:44:41,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-26 21:44:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:41,387 INFO L225 Difference]: With dead ends: 19 [2018-09-26 21:44:41,387 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 21:44:41,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 21:44:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-09-26 21:44:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 21:44:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-09-26 21:44:41,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2018-09-26 21:44:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:41,393 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-09-26 21:44:41,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:44:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-09-26 21:44:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:44:41,394 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:41,395 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2018-09-26 21:44:41,396 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:41,396 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:41,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1912214646, now seen corresponding path program 2 times [2018-09-26 21:44:41,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:41,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:41,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:41,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:41,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:41,492 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:41,493 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:44:41,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:44:41,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:44:41,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:44:41,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:41,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:41,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-26 21:44:41,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:44:41,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:44:41,620 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:41,620 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 5 states. [2018-09-26 21:44:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:41,923 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-09-26 21:44:41,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:44:41,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-09-26 21:44:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:41,925 INFO L225 Difference]: With dead ends: 21 [2018-09-26 21:44:41,925 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 21:44:41,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 21:44:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-26 21:44:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 21:44:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-09-26 21:44:41,932 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2018-09-26 21:44:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:41,932 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-09-26 21:44:41,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:44:41,932 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-09-26 21:44:41,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:44:41,934 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:41,934 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1] [2018-09-26 21:44:41,935 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:41,935 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:41,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1167329808, now seen corresponding path program 3 times [2018-09-26 21:44:41,936 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:41,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:41,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:41,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:44:41,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:42,013 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:42,013 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-26 21:44:42,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:44:42,037 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-09-26 21:44:42,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:44:42,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:42,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:42,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-26 21:44:42,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:44:42,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:44:42,115 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:42,115 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 6 states. [2018-09-26 21:44:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:42,225 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2018-09-26 21:44:42,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:44:42,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-09-26 21:44:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:42,227 INFO L225 Difference]: With dead ends: 23 [2018-09-26 21:44:42,227 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 21:44:42,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:42,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 21:44:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-09-26 21:44:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 21:44:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-09-26 21:44:42,234 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-09-26 21:44:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:42,234 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-09-26 21:44:42,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:44:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-09-26 21:44:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:44:42,235 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:42,235 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1] [2018-09-26 21:44:42,235 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:42,236 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:42,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1702428374, now seen corresponding path program 4 times [2018-09-26 21:44:42,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:42,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:42,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:42,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:44:42,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:42,546 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:42,547 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:44:42,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:44:42,605 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:44:42,606 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:44:42,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:42,807 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:42,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-26 21:44:42,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:44:42,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:44:42,808 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:42,808 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 7 states. [2018-09-26 21:44:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:42,916 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-09-26 21:44:42,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:44:42,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-09-26 21:44:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:42,918 INFO L225 Difference]: With dead ends: 25 [2018-09-26 21:44:42,918 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 21:44:42,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 21:44:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-26 21:44:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 21:44:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-09-26 21:44:42,924 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2018-09-26 21:44:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:42,925 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-09-26 21:44:42,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:44:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-09-26 21:44:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:44:42,926 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:42,926 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1] [2018-09-26 21:44:42,926 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:42,927 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:42,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2123930052, now seen corresponding path program 5 times [2018-09-26 21:44:42,927 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:42,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:42,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:42,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:44:42,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:43,080 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:43,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 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-26 21:44:43,087 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:44:43,127 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-26 21:44:43,128 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:44:43,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:43,207 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:43,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:43,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-26 21:44:43,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:44:43,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:44:43,229 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:43,230 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 8 states. [2018-09-26 21:44:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:43,363 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-09-26 21:44:43,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:44:43,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:44:43,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:43,365 INFO L225 Difference]: With dead ends: 27 [2018-09-26 21:44:43,366 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 21:44:43,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 21:44:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-09-26 21:44:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 21:44:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-09-26 21:44:43,372 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-09-26 21:44:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:43,372 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-09-26 21:44:43,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:44:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-09-26 21:44:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:44:43,373 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:43,373 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 2, 1, 1, 1] [2018-09-26 21:44:43,374 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:43,374 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:43,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1532595234, now seen corresponding path program 6 times [2018-09-26 21:44:43,374 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:43,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:43,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:43,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:44:43,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:43,484 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:43,485 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-26 21:44:43,493 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:44:43,518 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-09-26 21:44:43,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:44:43,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:44:43,644 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:43,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-09-26 21:44:43,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:44:43,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:44:43,646 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:43,646 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 10 states. [2018-09-26 21:44:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:43,856 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-09-26 21:44:43,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:44:43,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 21:44:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:43,859 INFO L225 Difference]: With dead ends: 31 [2018-09-26 21:44:43,859 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 21:44:43,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 21:44:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-09-26 21:44:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 21:44:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-09-26 21:44:43,870 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2018-09-26 21:44:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:43,870 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-09-26 21:44:43,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:44:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-09-26 21:44:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 21:44:43,871 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:43,871 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 2, 1, 1, 1] [2018-09-26 21:44:43,872 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:43,872 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:43,872 INFO L82 PathProgramCache]: Analyzing trace with hash -677024622, now seen corresponding path program 7 times [2018-09-26 21:44:43,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:43,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:43,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:43,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:44:43,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 25 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:44,172 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:44,172 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-26 21:44:44,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:44,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 25 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:44,584 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:44,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-09-26 21:44:44,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:44:44,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:44:44,585 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:44,585 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2018-09-26 21:44:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:44,896 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-09-26 21:44:44,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:44:44,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-09-26 21:44:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:44,898 INFO L225 Difference]: With dead ends: 33 [2018-09-26 21:44:44,899 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 21:44:44,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 21:44:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-26 21:44:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 21:44:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-09-26 21:44:44,907 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2018-09-26 21:44:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:44,907 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-09-26 21:44:44,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:44:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-09-26 21:44:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 21:44:44,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:44,909 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 2, 1, 1, 1] [2018-09-26 21:44:44,909 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:44,909 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash -305542356, now seen corresponding path program 8 times [2018-09-26 21:44:44,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:44,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:44,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:44,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 28 proven. 81 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:45,062 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:45,062 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-26 21:44:45,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:44:45,108 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:44:45,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:44:45,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 28 proven. 81 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:45,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:45,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-09-26 21:44:45,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:44:45,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:44:45,238 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:45,238 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 12 states. [2018-09-26 21:44:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:45,461 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-09-26 21:44:45,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:44:45,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-09-26 21:44:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:45,464 INFO L225 Difference]: With dead ends: 35 [2018-09-26 21:44:45,464 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 21:44:45,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 21:44:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-09-26 21:44:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 21:44:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-09-26 21:44:45,473 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2018-09-26 21:44:45,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:45,474 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-09-26 21:44:45,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:44:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-09-26 21:44:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 21:44:45,475 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:45,475 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 2, 1, 1, 1] [2018-09-26 21:44:45,475 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:45,475 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:45,476 INFO L82 PathProgramCache]: Analyzing trace with hash 206629702, now seen corresponding path program 9 times [2018-09-26 21:44:45,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:45,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:45,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:45,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:44:45,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 31 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:45,626 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:45,626 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-26 21:44:45,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:44:45,670 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-09-26 21:44:45,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:44:45,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 69 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-09-26 21:44:45,780 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:45,781 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 16 [2018-09-26 21:44:45,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:44:45,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:44:45,781 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:45,782 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 16 states. [2018-09-26 21:44:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:46,916 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-09-26 21:44:46,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:44:46,916 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-09-26 21:44:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:46,917 INFO L225 Difference]: With dead ends: 42 [2018-09-26 21:44:46,917 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 21:44:46,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 21:44:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-09-26 21:44:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 21:44:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-09-26 21:44:46,929 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 26 [2018-09-26 21:44:46,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:46,930 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-09-26 21:44:46,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:44:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-09-26 21:44:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:44:46,931 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:46,931 INFO L375 BasicCegarLoop]: trace histogram [13, 11, 3, 1, 1, 1] [2018-09-26 21:44:46,935 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:46,935 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2094433928, now seen corresponding path program 10 times [2018-09-26 21:44:46,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:46,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:46,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:44:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 57 proven. 121 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-26 21:44:47,264 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:47,264 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-26 21:44:47,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:44:47,329 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:44:47,330 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:44:47,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 57 proven. 121 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-26 21:44:47,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:47,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-09-26 21:44:47,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:44:47,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:44:47,715 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:47,715 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 14 states. [2018-09-26 21:44:47,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:47,850 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-09-26 21:44:47,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:44:47,850 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-09-26 21:44:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:47,851 INFO L225 Difference]: With dead ends: 43 [2018-09-26 21:44:47,852 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 21:44:47,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 21:44:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-26 21:44:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 21:44:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-09-26 21:44:47,861 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2018-09-26 21:44:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:47,862 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-09-26 21:44:47,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:44:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-09-26 21:44:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 21:44:47,863 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:47,863 INFO L375 BasicCegarLoop]: trace histogram [14, 12, 3, 1, 1, 1] [2018-09-26 21:44:47,863 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:47,864 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:47,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2026201582, now seen corresponding path program 11 times [2018-09-26 21:44:47,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:47,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:47,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:47,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:44:47,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 62 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-26 21:44:48,057 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:48,057 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-26 21:44:48,065 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:44:48,097 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-09-26 21:44:48,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:44:48,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 62 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-26 21:44:48,552 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:48,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-09-26 21:44:48,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:44:48,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:44:48,553 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:48,553 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 15 states. [2018-09-26 21:44:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:49,037 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-09-26 21:44:49,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:44:49,037 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-09-26 21:44:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:49,038 INFO L225 Difference]: With dead ends: 45 [2018-09-26 21:44:49,038 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 21:44:49,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 21:44:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-09-26 21:44:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 21:44:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-09-26 21:44:49,050 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2018-09-26 21:44:49,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:49,050 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-09-26 21:44:49,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:44:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-09-26 21:44:49,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:44:49,051 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:49,051 INFO L375 BasicCegarLoop]: trace histogram [15, 13, 3, 1, 1, 1] [2018-09-26 21:44:49,052 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:49,052 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:49,052 INFO L82 PathProgramCache]: Analyzing trace with hash -879426516, now seen corresponding path program 12 times [2018-09-26 21:44:49,052 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:49,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:49,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:49,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:44:49,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 67 proven. 169 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-26 21:44:49,297 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:49,298 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-26 21:44:49,309 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:44:49,331 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-09-26 21:44:49,331 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:44:49,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 222 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-26 21:44:49,836 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:49,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-09-26 21:44:49,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 21:44:49,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 21:44:49,837 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:49,837 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 30 states. [2018-09-26 21:44:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:54,057 INFO L93 Difference]: Finished difference Result 124 states and 175 transitions. [2018-09-26 21:44:54,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 21:44:54,057 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-09-26 21:44:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:54,059 INFO L225 Difference]: With dead ends: 124 [2018-09-26 21:44:54,059 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 21:44:54,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 21:44:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 59. [2018-09-26 21:44:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 21:44:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2018-09-26 21:44:54,079 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 34 [2018-09-26 21:44:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:54,080 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2018-09-26 21:44:54,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 21:44:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2018-09-26 21:44:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 21:44:54,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:54,081 INFO L375 BasicCegarLoop]: trace histogram [27, 14, 14, 1, 1, 1] [2018-09-26 21:44:54,082 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:54,082 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:54,082 INFO L82 PathProgramCache]: Analyzing trace with hash 407632846, now seen corresponding path program 13 times [2018-09-26 21:44:54,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:54,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:54,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:54,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:44:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 391 proven. 196 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-09-26 21:44:54,476 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:54,477 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:44:54,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:54,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 391 proven. 196 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-09-26 21:44:54,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:54,652 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-09-26 21:44:54,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:44:54,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:44:54,653 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:54,653 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 17 states. [2018-09-26 21:44:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:54,866 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2018-09-26 21:44:54,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:44:54,867 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-09-26 21:44:54,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:54,868 INFO L225 Difference]: With dead ends: 93 [2018-09-26 21:44:54,869 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 21:44:54,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 21:44:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-26 21:44:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 21:44:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2018-09-26 21:44:54,888 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 58 [2018-09-26 21:44:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:54,889 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2018-09-26 21:44:54,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:44:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2018-09-26 21:44:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 21:44:54,890 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:54,890 INFO L375 BasicCegarLoop]: trace histogram [28, 15, 14, 1, 1, 1] [2018-09-26 21:44:54,890 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:54,891 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1594791272, now seen corresponding path program 14 times [2018-09-26 21:44:54,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:54,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:54,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:54,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:54,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 418 proven. 225 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-09-26 21:44:55,032 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:55,032 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-26 21:44:55,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:44:55,073 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:44:55,073 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:44:55,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 418 proven. 225 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-09-26 21:44:55,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:55,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-09-26 21:44:55,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:44:55,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:44:55,245 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:55,246 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 18 states. [2018-09-26 21:44:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:55,624 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-09-26 21:44:55,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:44:55,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-09-26 21:44:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:55,626 INFO L225 Difference]: With dead ends: 95 [2018-09-26 21:44:55,626 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 21:44:55,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 21:44:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-09-26 21:44:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 21:44:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2018-09-26 21:44:55,646 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 60 [2018-09-26 21:44:55,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:55,647 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2018-09-26 21:44:55,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:44:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2018-09-26 21:44:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 21:44:55,648 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:55,648 INFO L375 BasicCegarLoop]: trace histogram [29, 16, 14, 1, 1, 1] [2018-09-26 21:44:55,648 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:55,649 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:55,649 INFO L82 PathProgramCache]: Analyzing trace with hash -7262078, now seen corresponding path program 15 times [2018-09-26 21:44:55,649 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:55,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:55,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:44:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 445 proven. 256 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-09-26 21:44:55,806 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:55,806 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-26 21:44:55,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:44:55,923 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-09-26 21:44:55,923 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:44:55,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 478 proven. 365 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-09-26 21:44:56,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:56,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-09-26 21:44:56,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 21:44:56,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 21:44:56,430 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:56,430 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 36 states. [2018-09-26 21:44:59,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:59,743 INFO L93 Difference]: Finished difference Result 184 states and 258 transitions. [2018-09-26 21:44:59,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 21:44:59,744 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 62 [2018-09-26 21:44:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:59,745 INFO L225 Difference]: With dead ends: 184 [2018-09-26 21:44:59,745 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 21:44:59,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 21:44:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 71. [2018-09-26 21:44:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 21:44:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2018-09-26 21:44:59,769 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 62 [2018-09-26 21:44:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:59,769 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2018-09-26 21:44:59,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 21:44:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2018-09-26 21:44:59,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 21:44:59,771 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:59,771 INFO L375 BasicCegarLoop]: trace histogram [33, 17, 17, 1, 1, 1] [2018-09-26 21:44:59,771 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:59,771 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:59,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1463704604, now seen corresponding path program 16 times [2018-09-26 21:44:59,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:59,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:59,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:59,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:44:59,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 577 proven. 289 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-09-26 21:45:00,037 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:00,037 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:45:00,050 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:45:00,082 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:45:00,082 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:00,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 97 proven. 1024 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:45:00,327 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:00,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 34] total 34 [2018-09-26 21:45:00,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 21:45:00,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 21:45:00,329 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:00,329 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 35 states. [2018-09-26 21:45:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:00,682 INFO L93 Difference]: Finished difference Result 141 states and 191 transitions. [2018-09-26 21:45:00,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 21:45:00,682 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2018-09-26 21:45:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:00,683 INFO L225 Difference]: With dead ends: 141 [2018-09-26 21:45:00,683 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 21:45:00,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 21:45:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-09-26 21:45:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 21:45:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2018-09-26 21:45:00,714 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 70 [2018-09-26 21:45:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:00,714 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2018-09-26 21:45:00,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 21:45:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2018-09-26 21:45:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 21:45:00,716 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:00,716 INFO L375 BasicCegarLoop]: trace histogram [49, 33, 17, 1, 1, 1] [2018-09-26 21:45:00,716 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:00,716 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1622311300, now seen corresponding path program 17 times [2018-09-26 21:45:00,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:00,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:00,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:00,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:00,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1105 proven. 1089 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-09-26 21:45:01,196 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:01,196 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:45:01,211 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:45:01,509 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2018-09-26 21:45:01,510 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:01,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1105 proven. 1089 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-09-26 21:45:01,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:01,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-09-26 21:45:01,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 21:45:01,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 21:45:01,842 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:01,843 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand 36 states. [2018-09-26 21:45:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:02,240 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2018-09-26 21:45:02,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 21:45:02,240 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 102 [2018-09-26 21:45:02,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:02,241 INFO L225 Difference]: With dead ends: 143 [2018-09-26 21:45:02,242 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 21:45:02,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 21:45:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-26 21:45:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 21:45:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2018-09-26 21:45:02,272 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 102 [2018-09-26 21:45:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:02,272 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2018-09-26 21:45:02,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 21:45:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2018-09-26 21:45:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 21:45:02,274 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:02,274 INFO L375 BasicCegarLoop]: trace histogram [50, 34, 17, 1, 1, 1] [2018-09-26 21:45:02,274 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:02,275 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:02,275 INFO L82 PathProgramCache]: Analyzing trace with hash 627612702, now seen corresponding path program 18 times [2018-09-26 21:45:02,275 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:02,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:02,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1138 proven. 1156 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-09-26 21:45:02,587 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:02,587 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-26 21:45:02,597 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:45:02,676 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2018-09-26 21:45:02,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:02,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1138 proven. 1156 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-09-26 21:45:02,877 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:02,877 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-09-26 21:45:02,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 21:45:02,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 21:45:02,878 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:02,878 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 37 states. [2018-09-26 21:45:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:03,290 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2018-09-26 21:45:03,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 21:45:03,290 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 104 [2018-09-26 21:45:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:03,291 INFO L225 Difference]: With dead ends: 145 [2018-09-26 21:45:03,291 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 21:45:03,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 21:45:03,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-09-26 21:45:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 21:45:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2018-09-26 21:45:03,322 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 104 [2018-09-26 21:45:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:03,322 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2018-09-26 21:45:03,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 21:45:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2018-09-26 21:45:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 21:45:03,324 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:03,324 INFO L375 BasicCegarLoop]: trace histogram [51, 35, 17, 1, 1, 1] [2018-09-26 21:45:03,324 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:03,324 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:03,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1795000264, now seen corresponding path program 19 times [2018-09-26 21:45:03,324 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:03,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:03,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:03,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:03,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 1171 proven. 1225 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-09-26 21:45:04,251 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:04,251 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-26 21:45:04,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:04,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 1171 proven. 1225 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-09-26 21:45:04,512 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:04,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-09-26 21:45:04,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 21:45:04,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 21:45:04,514 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:04,514 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand 38 states. [2018-09-26 21:45:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:04,999 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2018-09-26 21:45:04,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 21:45:04,999 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 106 [2018-09-26 21:45:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:05,000 INFO L225 Difference]: With dead ends: 147 [2018-09-26 21:45:05,000 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 21:45:05,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 21:45:05,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-09-26 21:45:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 21:45:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2018-09-26 21:45:05,030 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 106 [2018-09-26 21:45:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:05,031 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2018-09-26 21:45:05,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 21:45:05,031 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2018-09-26 21:45:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 21:45:05,032 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:05,032 INFO L375 BasicCegarLoop]: trace histogram [52, 36, 17, 1, 1, 1] [2018-09-26 21:45:05,032 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:05,032 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:05,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2053786158, now seen corresponding path program 20 times [2018-09-26 21:45:05,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:05,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:05,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:05,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 1204 proven. 1296 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-09-26 21:45:05,375 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:05,375 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-26 21:45:05,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:45:05,436 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:45:05,437 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:05,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 1204 proven. 1296 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-09-26 21:45:05,681 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:05,681 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-09-26 21:45:05,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 21:45:05,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 21:45:05,682 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:05,682 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 39 states. [2018-09-26 21:45:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:06,137 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2018-09-26 21:45:06,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 21:45:06,138 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 108 [2018-09-26 21:45:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:06,139 INFO L225 Difference]: With dead ends: 149 [2018-09-26 21:45:06,139 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 21:45:06,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 21:45:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-09-26 21:45:06,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 21:45:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2018-09-26 21:45:06,176 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 108 [2018-09-26 21:45:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:06,176 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2018-09-26 21:45:06,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 21:45:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2018-09-26 21:45:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 21:45:06,178 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:06,178 INFO L375 BasicCegarLoop]: trace histogram [53, 37, 17, 1, 1, 1] [2018-09-26 21:45:06,178 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:06,178 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1638927124, now seen corresponding path program 21 times [2018-09-26 21:45:06,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:06,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:06,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:06,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:06,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 1237 proven. 1369 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-09-26 21:45:07,090 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:07,090 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-26 21:45:07,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:45:07,184 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-09-26 21:45:07,184 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:07,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 2284 proven. 545 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-09-26 21:45:08,547 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:08,547 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-09-26 21:45:08,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 21:45:08,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 21:45:08,552 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:08,552 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand 78 states. [2018-09-26 21:45:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:23,790 INFO L93 Difference]: Finished difference Result 886 states and 1299 transitions. [2018-09-26 21:45:23,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 21:45:23,790 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 110 [2018-09-26 21:45:23,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:23,794 INFO L225 Difference]: With dead ends: 886 [2018-09-26 21:45:23,794 INFO L226 Difference]: Without dead ends: 849 [2018-09-26 21:45:23,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-09-26 21:45:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 155. [2018-09-26 21:45:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 21:45:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 193 transitions. [2018-09-26 21:45:23,908 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 193 transitions. Word has length 110 [2018-09-26 21:45:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:23,908 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 193 transitions. [2018-09-26 21:45:23,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 21:45:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 193 transitions. [2018-09-26 21:45:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 21:45:23,909 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:23,909 INFO L375 BasicCegarLoop]: trace histogram [75, 38, 38, 1, 1, 1] [2018-09-26 21:45:23,910 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:23,910 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:23,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1253490050, now seen corresponding path program 22 times [2018-09-26 21:45:23,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:23,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:23,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:23,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:23,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 2887 proven. 1444 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:24,288 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:24,288 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-26 21:45:24,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:45:24,370 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:45:24,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:24,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 2887 proven. 1444 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:24,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:24,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-09-26 21:45:24,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 21:45:24,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 21:45:24,641 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:24,642 INFO L87 Difference]: Start difference. First operand 155 states and 193 transitions. Second operand 41 states. [2018-09-26 21:45:25,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:25,155 INFO L93 Difference]: Finished difference Result 237 states and 314 transitions. [2018-09-26 21:45:25,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 21:45:25,156 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2018-09-26 21:45:25,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:25,157 INFO L225 Difference]: With dead ends: 237 [2018-09-26 21:45:25,157 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 21:45:25,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 21:45:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-26 21:45:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 21:45:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2018-09-26 21:45:25,266 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 154 [2018-09-26 21:45:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:25,266 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2018-09-26 21:45:25,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 21:45:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2018-09-26 21:45:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 21:45:25,267 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:25,267 INFO L375 BasicCegarLoop]: trace histogram [76, 39, 38, 1, 1, 1] [2018-09-26 21:45:25,267 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:25,267 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:25,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1772805096, now seen corresponding path program 23 times [2018-09-26 21:45:25,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:25,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:25,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:25,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:25,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 2962 proven. 1521 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:25,640 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:25,640 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-26 21:45:25,649 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:45:26,315 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 77 check-sat command(s) [2018-09-26 21:45:26,315 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:26,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 2962 proven. 1521 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:26,537 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:26,537 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-09-26 21:45:26,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 21:45:26,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 21:45:26,538 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:26,538 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand 42 states. [2018-09-26 21:45:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:27,069 INFO L93 Difference]: Finished difference Result 239 states and 316 transitions. [2018-09-26 21:45:27,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 21:45:27,070 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 156 [2018-09-26 21:45:27,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:27,071 INFO L225 Difference]: With dead ends: 239 [2018-09-26 21:45:27,071 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 21:45:27,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 21:45:27,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-09-26 21:45:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 21:45:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 197 transitions. [2018-09-26 21:45:27,178 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 197 transitions. Word has length 156 [2018-09-26 21:45:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:27,179 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 197 transitions. [2018-09-26 21:45:27,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 21:45:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 197 transitions. [2018-09-26 21:45:27,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 21:45:27,180 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:27,180 INFO L375 BasicCegarLoop]: trace histogram [77, 40, 38, 1, 1, 1] [2018-09-26 21:45:27,180 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:27,180 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1676609330, now seen corresponding path program 24 times [2018-09-26 21:45:27,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:27,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:27,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 3037 proven. 1600 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:27,693 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:27,693 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-26 21:45:27,701 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:45:27,835 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 77 check-sat command(s) [2018-09-26 21:45:27,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:27,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 3037 proven. 1600 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:28,109 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:28,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-09-26 21:45:28,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 21:45:28,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 21:45:28,110 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:28,110 INFO L87 Difference]: Start difference. First operand 159 states and 197 transitions. Second operand 43 states. [2018-09-26 21:45:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:28,733 INFO L93 Difference]: Finished difference Result 241 states and 318 transitions. [2018-09-26 21:45:28,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 21:45:28,733 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 158 [2018-09-26 21:45:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:28,734 INFO L225 Difference]: With dead ends: 241 [2018-09-26 21:45:28,735 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 21:45:28,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 21:45:28,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-26 21:45:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 21:45:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 199 transitions. [2018-09-26 21:45:28,844 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 199 transitions. Word has length 158 [2018-09-26 21:45:28,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:28,844 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 199 transitions. [2018-09-26 21:45:28,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 21:45:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2018-09-26 21:45:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 21:45:28,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:28,845 INFO L375 BasicCegarLoop]: trace histogram [78, 41, 38, 1, 1, 1] [2018-09-26 21:45:28,845 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:28,845 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:28,846 INFO L82 PathProgramCache]: Analyzing trace with hash 849120204, now seen corresponding path program 25 times [2018-09-26 21:45:28,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:28,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:28,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:28,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:28,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 3112 proven. 1681 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:29,223 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:29,223 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:45:29,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:29,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 3112 proven. 1681 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:29,544 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:29,544 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-09-26 21:45:29,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 21:45:29,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 21:45:29,545 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:29,545 INFO L87 Difference]: Start difference. First operand 161 states and 199 transitions. Second operand 44 states. [2018-09-26 21:45:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:30,902 INFO L93 Difference]: Finished difference Result 243 states and 320 transitions. [2018-09-26 21:45:30,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 21:45:30,902 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 160 [2018-09-26 21:45:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:30,903 INFO L225 Difference]: With dead ends: 243 [2018-09-26 21:45:30,903 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 21:45:30,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:30,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 21:45:31,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-09-26 21:45:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 21:45:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 201 transitions. [2018-09-26 21:45:31,069 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 201 transitions. Word has length 160 [2018-09-26 21:45:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:31,069 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 201 transitions. [2018-09-26 21:45:31,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 21:45:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 201 transitions. [2018-09-26 21:45:31,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 21:45:31,070 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:31,070 INFO L375 BasicCegarLoop]: trace histogram [79, 42, 38, 1, 1, 1] [2018-09-26 21:45:31,071 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:31,071 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:31,071 INFO L82 PathProgramCache]: Analyzing trace with hash 201019878, now seen corresponding path program 26 times [2018-09-26 21:45:31,071 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:31,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:31,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:31,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:31,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 3187 proven. 1764 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:32,355 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:32,355 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-26 21:45:32,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:45:32,436 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:45:32,436 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:32,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 3187 proven. 1764 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:32,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:32,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-09-26 21:45:32,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 21:45:32,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 21:45:32,759 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:32,759 INFO L87 Difference]: Start difference. First operand 163 states and 201 transitions. Second operand 45 states. [2018-09-26 21:45:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:33,379 INFO L93 Difference]: Finished difference Result 245 states and 322 transitions. [2018-09-26 21:45:33,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 21:45:33,380 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 162 [2018-09-26 21:45:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:33,381 INFO L225 Difference]: With dead ends: 245 [2018-09-26 21:45:33,381 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 21:45:33,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 21:45:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-26 21:45:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 21:45:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 203 transitions. [2018-09-26 21:45:33,498 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 203 transitions. Word has length 162 [2018-09-26 21:45:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:33,498 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 203 transitions. [2018-09-26 21:45:33,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 21:45:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 203 transitions. [2018-09-26 21:45:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 21:45:33,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:33,499 INFO L375 BasicCegarLoop]: trace histogram [80, 43, 38, 1, 1, 1] [2018-09-26 21:45:33,500 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:33,500 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash 146864512, now seen corresponding path program 27 times [2018-09-26 21:45:33,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:33,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:33,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:33,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:33,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 3262 proven. 1849 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:33,962 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:33,962 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-26 21:45:33,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:45:34,146 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-09-26 21:45:34,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:34,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 3262 proven. 1849 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:34,415 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:34,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-09-26 21:45:34,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 21:45:34,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 21:45:34,417 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:34,417 INFO L87 Difference]: Start difference. First operand 165 states and 203 transitions. Second operand 46 states. [2018-09-26 21:45:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:35,004 INFO L93 Difference]: Finished difference Result 247 states and 324 transitions. [2018-09-26 21:45:35,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 21:45:35,005 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 164 [2018-09-26 21:45:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:35,006 INFO L225 Difference]: With dead ends: 247 [2018-09-26 21:45:35,006 INFO L226 Difference]: Without dead ends: 168 [2018-09-26 21:45:35,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-26 21:45:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-09-26 21:45:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 21:45:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2018-09-26 21:45:35,123 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 164 [2018-09-26 21:45:35,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:35,123 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2018-09-26 21:45:35,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 21:45:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2018-09-26 21:45:35,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 21:45:35,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:35,125 INFO L375 BasicCegarLoop]: trace histogram [81, 44, 38, 1, 1, 1] [2018-09-26 21:45:35,125 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:35,125 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:35,125 INFO L82 PathProgramCache]: Analyzing trace with hash -356834662, now seen corresponding path program 28 times [2018-09-26 21:45:35,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:35,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:35,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:35,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:35,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 3337 proven. 1936 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:35,607 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:35,607 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-26 21:45:35,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:45:35,691 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:45:35,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:35,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 3337 proven. 1936 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:37,436 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:37,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-09-26 21:45:37,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 21:45:37,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 21:45:37,437 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:37,438 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand 47 states. [2018-09-26 21:45:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:38,236 INFO L93 Difference]: Finished difference Result 249 states and 326 transitions. [2018-09-26 21:45:38,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 21:45:38,239 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 166 [2018-09-26 21:45:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:38,240 INFO L225 Difference]: With dead ends: 249 [2018-09-26 21:45:38,240 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 21:45:38,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:38,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 21:45:38,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-26 21:45:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 21:45:38,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 207 transitions. [2018-09-26 21:45:38,353 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 207 transitions. Word has length 166 [2018-09-26 21:45:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:38,353 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 207 transitions. [2018-09-26 21:45:38,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 21:45:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2018-09-26 21:45:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 21:45:38,354 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:38,354 INFO L375 BasicCegarLoop]: trace histogram [82, 45, 38, 1, 1, 1] [2018-09-26 21:45:38,354 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:38,355 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:38,355 INFO L82 PathProgramCache]: Analyzing trace with hash 919563572, now seen corresponding path program 29 times [2018-09-26 21:45:38,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:38,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:38,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:38,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:38,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 3412 proven. 2025 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:38,899 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:38,899 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:45:38,907 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:45:39,076 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) [2018-09-26 21:45:39,076 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:39,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 3412 proven. 2025 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:39,330 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:39,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-09-26 21:45:39,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 21:45:39,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 21:45:39,332 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:39,332 INFO L87 Difference]: Start difference. First operand 169 states and 207 transitions. Second operand 48 states. [2018-09-26 21:45:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:40,025 INFO L93 Difference]: Finished difference Result 251 states and 328 transitions. [2018-09-26 21:45:40,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 21:45:40,026 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 168 [2018-09-26 21:45:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:40,027 INFO L225 Difference]: With dead ends: 251 [2018-09-26 21:45:40,027 INFO L226 Difference]: Without dead ends: 172 [2018-09-26 21:45:40,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-26 21:45:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-09-26 21:45:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 21:45:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 209 transitions. [2018-09-26 21:45:40,131 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 209 transitions. Word has length 168 [2018-09-26 21:45:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:40,132 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 209 transitions. [2018-09-26 21:45:40,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 21:45:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 209 transitions. [2018-09-26 21:45:40,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 21:45:40,132 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:40,133 INFO L375 BasicCegarLoop]: trace histogram [83, 46, 38, 1, 1, 1] [2018-09-26 21:45:40,133 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:40,133 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:40,133 INFO L82 PathProgramCache]: Analyzing trace with hash -822380210, now seen corresponding path program 30 times [2018-09-26 21:45:40,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:40,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:40,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:40,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:40,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 3487 proven. 2116 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:40,612 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:40,612 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:45:40,619 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:45:40,771 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 84 check-sat command(s) [2018-09-26 21:45:40,771 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:40,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 3487 proven. 2116 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:42,297 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:42,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-09-26 21:45:42,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 21:45:42,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 21:45:42,298 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:42,298 INFO L87 Difference]: Start difference. First operand 171 states and 209 transitions. Second operand 49 states. [2018-09-26 21:45:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:43,272 INFO L93 Difference]: Finished difference Result 253 states and 330 transitions. [2018-09-26 21:45:43,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 21:45:43,273 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 170 [2018-09-26 21:45:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:43,274 INFO L225 Difference]: With dead ends: 253 [2018-09-26 21:45:43,274 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 21:45:43,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:43,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 21:45:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-26 21:45:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 21:45:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 211 transitions. [2018-09-26 21:45:43,382 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 211 transitions. Word has length 170 [2018-09-26 21:45:43,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:43,382 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 211 transitions. [2018-09-26 21:45:43,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 21:45:43,383 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 211 transitions. [2018-09-26 21:45:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 21:45:43,383 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:43,383 INFO L375 BasicCegarLoop]: trace histogram [84, 47, 38, 1, 1, 1] [2018-09-26 21:45:43,384 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:43,384 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:43,384 INFO L82 PathProgramCache]: Analyzing trace with hash 206890728, now seen corresponding path program 31 times [2018-09-26 21:45:43,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:43,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:43,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:43,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:43,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 3562 proven. 2209 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:44,085 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:44,085 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-26 21:45:44,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:44,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 3562 proven. 2209 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:44,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:44,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-09-26 21:45:44,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 21:45:44,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 21:45:44,601 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:44,602 INFO L87 Difference]: Start difference. First operand 173 states and 211 transitions. Second operand 50 states. [2018-09-26 21:45:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:45,342 INFO L93 Difference]: Finished difference Result 255 states and 332 transitions. [2018-09-26 21:45:45,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 21:45:45,343 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 172 [2018-09-26 21:45:45,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:45,344 INFO L225 Difference]: With dead ends: 255 [2018-09-26 21:45:45,344 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 21:45:45,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 21:45:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-09-26 21:45:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 21:45:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 213 transitions. [2018-09-26 21:45:45,508 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 213 transitions. Word has length 172 [2018-09-26 21:45:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:45,508 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 213 transitions. [2018-09-26 21:45:45,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 21:45:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 213 transitions. [2018-09-26 21:45:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 21:45:45,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:45,510 INFO L375 BasicCegarLoop]: trace histogram [85, 48, 38, 1, 1, 1] [2018-09-26 21:45:45,510 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:45,510 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:45,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1493784066, now seen corresponding path program 32 times [2018-09-26 21:45:45,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:45,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:45,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:45,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:45,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 3637 proven. 2304 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:46,268 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:46,268 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-26 21:45:46,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:45:46,353 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:45:46,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:46,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 3637 proven. 2304 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:46,651 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:46,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-09-26 21:45:46,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 21:45:46,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 21:45:46,652 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:46,653 INFO L87 Difference]: Start difference. First operand 175 states and 213 transitions. Second operand 51 states. [2018-09-26 21:45:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:47,374 INFO L93 Difference]: Finished difference Result 257 states and 334 transitions. [2018-09-26 21:45:47,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 21:45:47,375 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 174 [2018-09-26 21:45:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:47,376 INFO L225 Difference]: With dead ends: 257 [2018-09-26 21:45:47,376 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 21:45:47,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 21:45:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-26 21:45:47,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 21:45:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 215 transitions. [2018-09-26 21:45:47,487 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 215 transitions. Word has length 174 [2018-09-26 21:45:47,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:47,487 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 215 transitions. [2018-09-26 21:45:47,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 21:45:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 215 transitions. [2018-09-26 21:45:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 21:45:47,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:47,488 INFO L375 BasicCegarLoop]: trace histogram [86, 49, 38, 1, 1, 1] [2018-09-26 21:45:47,489 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:47,489 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1247700636, now seen corresponding path program 33 times [2018-09-26 21:45:47,489 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:47,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:47,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:47,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:47,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 3712 proven. 2401 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:48,826 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:48,826 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-26 21:45:48,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:45:49,000 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-09-26 21:45:49,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:49,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 3712 proven. 2401 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2018-09-26 21:45:49,351 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:49,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-09-26 21:45:49,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 21:45:49,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 21:45:49,352 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:49,353 INFO L87 Difference]: Start difference. First operand 177 states and 215 transitions. Second operand 52 states. [2018-09-26 21:45:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:50,057 INFO L93 Difference]: Finished difference Result 294 states and 371 transitions. [2018-09-26 21:45:50,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 21:45:50,057 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 176 [2018-09-26 21:45:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:50,058 INFO L225 Difference]: With dead ends: 294 [2018-09-26 21:45:50,058 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 21:45:50,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 21:45:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 179. [2018-09-26 21:45:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 21:45:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 217 transitions. [2018-09-26 21:45:50,162 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 217 transitions. Word has length 176 [2018-09-26 21:45:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:50,163 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 217 transitions. [2018-09-26 21:45:50,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 21:45:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 217 transitions. [2018-09-26 21:45:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 21:45:50,163 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:50,163 INFO L375 BasicCegarLoop]: trace histogram [87, 50, 38, 1, 1, 1] [2018-09-26 21:45:50,164 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:50,164 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:50,164 INFO L82 PathProgramCache]: Analyzing trace with hash 984725686, now seen corresponding path program 34 times [2018-09-26 21:45:50,164 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:50,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:50,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:50,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:50,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 4768 proven. 2813 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-09-26 21:45:51,249 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:51,249 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-26 21:45:51,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:45:51,356 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:45:51,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:51,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 4768 proven. 2813 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-09-26 21:45:51,843 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:51,843 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-09-26 21:45:51,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 21:45:51,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 21:45:51,844 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:51,844 INFO L87 Difference]: Start difference. First operand 179 states and 217 transitions. Second operand 53 states. [2018-09-26 21:45:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:55,631 INFO L93 Difference]: Finished difference Result 1182 states and 1726 transitions. [2018-09-26 21:45:55,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 21:45:55,632 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 178 [2018-09-26 21:45:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:55,640 INFO L225 Difference]: With dead ends: 1182 [2018-09-26 21:45:55,640 INFO L226 Difference]: Without dead ends: 1180 [2018-09-26 21:45:55,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2018-09-26 21:45:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 205. [2018-09-26 21:45:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 21:45:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 256 transitions. [2018-09-26 21:45:55,936 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 256 transitions. Word has length 178 [2018-09-26 21:45:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:55,936 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 256 transitions. [2018-09-26 21:45:55,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 21:45:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 256 transitions. [2018-09-26 21:45:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 21:45:55,938 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:55,938 INFO L375 BasicCegarLoop]: trace histogram [100, 51, 50, 1, 1, 1] [2018-09-26 21:45:55,939 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:55,939 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:55,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1557903122, now seen corresponding path program 35 times [2018-09-26 21:45:55,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:55,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:55,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:55,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:55,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:46:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 5098 proven. 2601 refuted. 0 times theorem prover too weak. 2401 trivial. 0 not checked. [2018-09-26 21:46:00,022 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:46:00,022 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-26 21:46:00,029 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:46:00,256 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 101 check-sat command(s) [2018-09-26 21:46:00,256 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:46:00,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:46:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 5098 proven. 2601 refuted. 0 times theorem prover too weak. 2401 trivial. 0 not checked. [2018-09-26 21:46:00,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:46:00,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-09-26 21:46:00,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 21:46:00,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 21:46:00,940 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:46:00,940 INFO L87 Difference]: Start difference. First operand 205 states and 256 transitions. Second operand 55 states. [2018-09-26 21:46:35,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:46:35,045 INFO L93 Difference]: Finished difference Result 3007 states and 4385 transitions. [2018-09-26 21:46:35,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 21:46:35,046 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-09-26 21:46:35,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:46:35,058 INFO L225 Difference]: With dead ends: 3007 [2018-09-26 21:46:35,058 INFO L226 Difference]: Without dead ends: 2902 [2018-09-26 21:46:35,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:46:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2018-09-26 21:46:41,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2804. [2018-09-26 21:46:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2804 states. [2018-09-26 21:46:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 2904 transitions. [2018-09-26 21:46:41,532 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 2904 transitions. Word has length 204 [2018-09-26 21:46:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:46:41,532 INFO L480 AbstractCegarLoop]: Abstraction has 2804 states and 2904 transitions. [2018-09-26 21:46:41,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 21:46:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 2904 transitions. [2018-09-26 21:46:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 21:46:41,533 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:46:41,533 INFO L375 BasicCegarLoop]: trace histogram [101, 52, 50, 1, 1, 1] [2018-09-26 21:46:41,534 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:46:41,534 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:46:41,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1798736390, now seen corresponding path program 36 times [2018-09-26 21:46:41,534 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:46:41,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:46:41,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:46:41,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:46:41,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:46:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:46:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 5302 proven. 4901 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-09-26 21:46:42,785 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:46:42,785 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-26 21:46:42,792 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:46:42,991 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 102 check-sat command(s) [2018-09-26 21:46:42,991 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:46:42,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:46:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 5302 proven. 4901 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-09-26 21:46:43,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:46:43,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-09-26 21:46:43,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 21:46:43,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 21:46:43,701 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:46:43,701 INFO L87 Difference]: Start difference. First operand 2804 states and 2904 transitions. Second operand 54 states. [2018-09-26 21:46:54,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:46:54,434 INFO L93 Difference]: Finished difference Result 5611 states and 5812 transitions. [2018-09-26 21:46:54,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 21:46:54,434 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 206 [2018-09-26 21:46:54,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:46:54,444 INFO L225 Difference]: With dead ends: 5611 [2018-09-26 21:46:54,444 INFO L226 Difference]: Without dead ends: 2806 [2018-09-26 21:46:54,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:46:54,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2018-09-26 21:47:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2806. [2018-09-26 21:47:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2806 states. [2018-09-26 21:47:00,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 2906 transitions. [2018-09-26 21:47:00,684 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 2906 transitions. Word has length 206 [2018-09-26 21:47:00,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:47:00,685 INFO L480 AbstractCegarLoop]: Abstraction has 2806 states and 2906 transitions. [2018-09-26 21:47:00,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 21:47:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 2906 transitions. [2018-09-26 21:47:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 21:47:00,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:47:00,686 INFO L375 BasicCegarLoop]: trace histogram [102, 52, 51, 1, 1, 1] [2018-09-26 21:47:00,686 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:47:00,686 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:47:00,686 INFO L82 PathProgramCache]: Analyzing trace with hash -132992352, now seen corresponding path program 37 times [2018-09-26 21:47:00,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:47:00,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:47:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:47:00,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:47:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:47:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:47:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 7802 proven. 0 refuted. 0 times theorem prover too weak. 2704 trivial. 0 not checked. [2018-09-26 21:47:01,499 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:47:01,499 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-09-26 21:47:01,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 21:47:01,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 21:47:01,500 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:47:01,500 INFO L87 Difference]: Start difference. First operand 2806 states and 2906 transitions. Second operand 53 states. [2018-09-26 21:47:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:47:02,198 INFO L93 Difference]: Finished difference Result 2806 states and 2906 transitions. [2018-09-26 21:47:02,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 21:47:02,199 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 208 [2018-09-26 21:47:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:47:02,199 INFO L225 Difference]: With dead ends: 2806 [2018-09-26 21:47:02,199 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:47:02,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:47:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:47:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:47:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:47:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:47:02,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 208 [2018-09-26 21:47:02,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:47:02,203 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:47:02,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 21:47:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:47:02,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:47:02,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:47:02,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:47:08,620 WARN L178 SmtUtils]: Spent 6.38 s on a formula simplification. DAG size of input: 1731 DAG size of output: 1115 [2018-09-26 21:47:11,480 WARN L178 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 1588 DAG size of output: 1118 [2018-09-26 21:47:24,181 WARN L178 SmtUtils]: Spent 12.68 s on a formula simplification. DAG size of input: 1115 DAG size of output: 511 [2018-09-26 21:47:33,439 WARN L178 SmtUtils]: Spent 9.25 s on a formula simplification. DAG size of input: 1115 DAG size of output: 509 [2018-09-26 21:47:33,444 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 55) no Hoare annotation was computed. [2018-09-26 21:47:33,444 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 55) no Hoare annotation was computed. [2018-09-26 21:47:33,444 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 54) no Hoare annotation was computed. [2018-09-26 21:47:33,444 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 55) no Hoare annotation was computed. [2018-09-26 21:47:33,445 INFO L422 ceAbstractionStarter]: At program point L52(lines 20 52) the Hoare annotation is: (let ((.cse9 (<= 46 ULTIMATE.start_main_~y~4)) (.cse8 (<= ULTIMATE.start_main_~y~4 46)) (.cse11 (<= 2 ULTIMATE.start_main_~y~4)) (.cse10 (<= ULTIMATE.start_main_~y~4 2)) (.cse22 (<= 21 ULTIMATE.start_main_~y~4)) (.cse23 (<= ULTIMATE.start_main_~y~4 21)) (.cse32 (<= ULTIMATE.start_main_~y~4 44)) (.cse33 (<= 44 ULTIMATE.start_main_~y~4)) (.cse13 (<= ULTIMATE.start_main_~y~4 42)) (.cse12 (<= 42 ULTIMATE.start_main_~y~4)) (.cse43 (<= ULTIMATE.start_main_~y~4 12)) (.cse42 (<= 12 ULTIMATE.start_main_~y~4)) (.cse50 (<= ULTIMATE.start_main_~y~4 22)) (.cse51 (<= 22 ULTIMATE.start_main_~y~4)) (.cse28 (<= ULTIMATE.start_main_~y~4 29)) (.cse29 (<= 29 ULTIMATE.start_main_~y~4)) (.cse62 (<= 16 ULTIMATE.start_main_~y~4)) (.cse63 (<= ULTIMATE.start_main_~y~4 16)) (.cse60 (<= ULTIMATE.start_main_~y~4 30)) (.cse61 (<= 30 ULTIMATE.start_main_~y~4)) (.cse2 (<= 4 ULTIMATE.start_main_~y~4)) (.cse3 (<= ULTIMATE.start_main_~y~4 4)) (.cse7 (<= ULTIMATE.start_main_~y~4 18)) (.cse6 (<= 18 ULTIMATE.start_main_~y~4)) (.cse34 (<= 45 ULTIMATE.start_main_~y~4)) (.cse35 (<= ULTIMATE.start_main_~y~4 45)) (.cse68 (<= 35 ULTIMATE.start_main_~y~4)) (.cse69 (<= ULTIMATE.start_main_~y~4 35)) (.cse4 (<= 31 ULTIMATE.start_main_~y~4)) (.cse5 (<= ULTIMATE.start_main_~y~4 31)) (.cse75 (<= ULTIMATE.start_main_~y~4 38)) (.cse74 (<= 38 ULTIMATE.start_main_~y~4)) (.cse82 (<= ULTIMATE.start_main_~y~4 13)) (.cse83 (<= 13 ULTIMATE.start_main_~y~4)) (.cse36 (<= 48 ULTIMATE.start_main_~y~4)) (.cse37 (<= ULTIMATE.start_main_~y~4 48)) (.cse26 (<= 32 ULTIMATE.start_main_~y~4)) (.cse27 (<= ULTIMATE.start_main_~y~4 32)) (.cse16 (<= 19 ULTIMATE.start_main_~y~4)) (.cse17 (<= ULTIMATE.start_main_~y~4 19)) (.cse46 (<= 43 ULTIMATE.start_main_~y~4)) (.cse47 (<= ULTIMATE.start_main_~y~4 43)) (.cse78 (<= 6 ULTIMATE.start_main_~y~4)) (.cse79 (<= ULTIMATE.start_main_~y~4 6)) (.cse18 (<= 5 ULTIMATE.start_main_~y~4)) (.cse19 (<= ULTIMATE.start_main_~y~4 5)) (.cse55 (<= 34 ULTIMATE.start_main_~y~4)) (.cse54 (<= ULTIMATE.start_main_~y~4 34)) (.cse81 (<= 3 ULTIMATE.start_main_~y~4)) (.cse80 (<= ULTIMATE.start_main_~y~4 3)) (.cse66 (<= ULTIMATE.start_main_~y~4 36)) (.cse67 (<= 36 ULTIMATE.start_main_~y~4)) (.cse71 (<= 25 ULTIMATE.start_main_~y~4)) (.cse70 (<= ULTIMATE.start_main_~y~4 25)) (.cse85 (<= 23 ULTIMATE.start_main_~y~4)) (.cse84 (<= ULTIMATE.start_main_~y~4 23)) (.cse57 (<= ULTIMATE.start_main_~y~4 37)) (.cse56 (<= 37 ULTIMATE.start_main_~y~4)) (.cse90 (<= ULTIMATE.start_main_~y~4 15)) (.cse91 (<= 15 ULTIMATE.start_main_~y~4)) (.cse21 (<= ULTIMATE.start_main_~y~4 40)) (.cse20 (<= 40 ULTIMATE.start_main_~y~4)) (.cse58 (<= ULTIMATE.start_main_~y~4 27)) (.cse59 (<= 27 ULTIMATE.start_main_~y~4)) (.cse72 (<= 8 ULTIMATE.start_main_~y~4)) (.cse73 (<= ULTIMATE.start_main_~y~4 8)) (.cse52 (<= 47 ULTIMATE.start_main_~y~4)) (.cse53 (<= ULTIMATE.start_main_~y~4 47)) (.cse48 (<= ULTIMATE.start_main_~y~4 7)) (.cse49 (<= 7 ULTIMATE.start_main_~y~4)) (.cse38 (<= 14 ULTIMATE.start_main_~y~4)) (.cse39 (<= ULTIMATE.start_main_~y~4 14)) (.cse45 (<= ULTIMATE.start_main_~y~4 39)) (.cse44 (<= 39 ULTIMATE.start_main_~y~4)) (.cse76 (<= 17 ULTIMATE.start_main_~y~4)) (.cse77 (<= ULTIMATE.start_main_~y~4 17)) (.cse30 (<= ULTIMATE.start_main_~y~4 10)) (.cse31 (<= 10 ULTIMATE.start_main_~y~4)) (.cse1 (<= ULTIMATE.start_main_~y~4 24)) (.cse0 (<= 24 ULTIMATE.start_main_~y~4)) (.cse94 (<= 49 ULTIMATE.start_main_~y~4)) (.cse95 (<= ULTIMATE.start_main_~y~4 49)) (.cse89 (<= ULTIMATE.start_main_~y~4 28)) (.cse88 (<= 28 ULTIMATE.start_main_~y~4)) (.cse99 (<= 26 ULTIMATE.start_main_~y~4)) (.cse98 (<= ULTIMATE.start_main_~y~4 26)) (.cse40 (<= ULTIMATE.start_main_~y~4 9)) (.cse41 (<= 9 ULTIMATE.start_main_~y~4)) (.cse14 (<= 33 ULTIMATE.start_main_~y~4)) (.cse15 (<= ULTIMATE.start_main_~y~4 33)) (.cse92 (<= ULTIMATE.start_main_~y~4 0)) (.cse93 (<= 0 ULTIMATE.start_main_~y~4)) (.cse96 (<= ULTIMATE.start_main_~y~4 1)) (.cse97 (<= 1 ULTIMATE.start_main_~y~4)) (.cse64 (<= 20 ULTIMATE.start_main_~y~4)) (.cse65 (<= ULTIMATE.start_main_~y~4 20)) (.cse24 (<= ULTIMATE.start_main_~y~4 41)) (.cse25 (<= 41 ULTIMATE.start_main_~y~4)) (.cse87 (<= 11 ULTIMATE.start_main_~y~4)) (.cse86 (<= ULTIMATE.start_main_~y~4 11))) (or (and .cse0 (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4) .cse1) (and .cse2 (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4) .cse3) (and (<= ULTIMATE.start_main_~x~4 31) .cse4 .cse5 (<= 31 ULTIMATE.start_main_~x~4)) (and .cse6 (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) .cse7) (and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4) .cse8 .cse9) (and .cse10 .cse11 (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)) (and (<= 58 ULTIMATE.start_main_~x~4) .cse12 .cse13 (<= ULTIMATE.start_main_~x~4 58)) (and (<= 67 ULTIMATE.start_main_~x~4) .cse14 .cse15 (<= ULTIMATE.start_main_~x~4 67)) (and .cse16 (<= 19 ULTIMATE.start_main_~x~4) .cse17 (<= ULTIMATE.start_main_~x~4 19)) (and (<= ULTIMATE.start_main_~x~4 5) .cse18 .cse19 (<= 5 ULTIMATE.start_main_~x~4)) (and .cse20 (<= 60 ULTIMATE.start_main_~x~4) .cse21 (<= ULTIMATE.start_main_~x~4 60)) (and .cse22 (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79) .cse23) (and (<= ULTIMATE.start_main_~x~4 59) .cse24 .cse25 (<= 59 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 54) .cse9 .cse8 (<= 54 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) .cse26 .cse27) (and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) .cse28 .cse29) (and .cse11 (<= ULTIMATE.start_main_~x~4 98) .cse10 (<= 98 ULTIMATE.start_main_~x~4)) (and .cse30 (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~x~4) .cse31) (and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44) .cse32 .cse33) (and .cse34 (<= 45 ULTIMATE.start_main_~x~4) .cse35 (<= ULTIMATE.start_main_~x~4 45)) (and (<= 48 ULTIMATE.start_main_~x~4) .cse36 .cse37 (<= ULTIMATE.start_main_~x~4 48)) (and .cse38 (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14) .cse39) (and .cse40 (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9) .cse41) (and (<= 12 ULTIMATE.start_main_~x~4) .cse42 .cse43 (<= ULTIMATE.start_main_~x~4 12)) (and .cse44 (<= ULTIMATE.start_main_~x~4 39) .cse45 (<= 39 ULTIMATE.start_main_~x~4)) (and .cse46 (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57) .cse47) (and .cse48 .cse49 (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 21) .cse22 (<= 21 ULTIMATE.start_main_~x~4) .cse23) (and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56) .cse32 .cse33) (and .cse50 (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4) .cse51) (and .cse13 .cse12 (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) .cse52 .cse53) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)) (and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34) .cse54 .cse55) (and .cse56 (<= ULTIMATE.start_main_~x~4 37) .cse57 (<= 37 ULTIMATE.start_main_~x~4)) (and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88) .cse43 .cse42) (and .cse58 (<= ULTIMATE.start_main_~x~4 27) .cse59 (<= 27 ULTIMATE.start_main_~x~4)) (and .cse50 (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4) .cse51) (and .cse60 (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) .cse61) (and (<= 29 ULTIMATE.start_main_~x~4) .cse28 .cse29 (<= ULTIMATE.start_main_~x~4 29)) (and .cse62 (<= ULTIMATE.start_main_~x~4 84) .cse63 (<= 84 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 80) .cse64 (<= 80 ULTIMATE.start_main_~x~4) .cse65) (and (<= ULTIMATE.start_main_~x~4 64) .cse66 (<= 64 ULTIMATE.start_main_~x~4) .cse67) (and (<= ULTIMATE.start_main_~x~4 35) .cse68 (<= 35 ULTIMATE.start_main_~x~4) .cse69) (and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4) .cse62 .cse63) (and .cse60 (<= ULTIMATE.start_main_~x~4 30) .cse61 (<= 30 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4) .cse70 .cse71) (and (<= ULTIMATE.start_main_~x~4 8) .cse72 .cse73 (<= 8 ULTIMATE.start_main_~x~4)) (and .cse74 (<= ULTIMATE.start_main_~x~4 62) .cse75 (<= 62 ULTIMATE.start_main_~x~4)) (and .cse2 (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4) .cse3) (and (<= ULTIMATE.start_main_~x~4 17) .cse76 .cse77 (<= 17 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) .cse7 .cse6) (and (<= 55 ULTIMATE.start_main_~x~4) .cse34 (<= ULTIMATE.start_main_~x~4 55) .cse35) (and .cse78 .cse79 (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)) (and .cse68 .cse69 (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)) (and .cse4 (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69) .cse5) (and (<= 3 ULTIMATE.start_main_~x~4) .cse80 .cse81 (<= ULTIMATE.start_main_~x~4 3)) (and .cse82 (<= ULTIMATE.start_main_~x~4 87) .cse83 (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38) .cse75 .cse74) (and .cse82 .cse83 (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4) .cse84 .cse85) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) .cse36 .cse37) (and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) .cse86 .cse87) (and (<= ULTIMATE.start_main_~x~4 32) .cse26 (<= 32 ULTIMATE.start_main_~x~4) .cse27) (and .cse16 (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) .cse17) (and .cse46 (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4) .cse47) (and .cse88 (<= 72 ULTIMATE.start_main_~x~4) .cse89 (<= ULTIMATE.start_main_~x~4 72)) (and (<= 6 ULTIMATE.start_main_~x~4) .cse78 .cse79 (<= ULTIMATE.start_main_~x~4 6)) (and .cse18 .cse19 (<= 95 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 95)) (and (<= 66 ULTIMATE.start_main_~x~4) .cse55 (<= ULTIMATE.start_main_~x~4 66) .cse54) (and .cse90 .cse91 (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and .cse92 .cse93 (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)) (and .cse81 .cse80 (<= 97 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 97)) (and (<= 36 ULTIMATE.start_main_~x~4) .cse66 (<= ULTIMATE.start_main_~x~4 36) .cse67) (and .cse71 .cse70 (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 77) .cse85 (<= 77 ULTIMATE.start_main_~x~4) .cse84) (and (<= 63 ULTIMATE.start_main_~x~4) .cse57 .cse56 (<= ULTIMATE.start_main_~x~4 63)) (and .cse90 (<= 15 ULTIMATE.start_main_~x~4) .cse91 (<= ULTIMATE.start_main_~x~4 15)) (and (<= 51 ULTIMATE.start_main_~x~4) .cse94 .cse95 (<= ULTIMATE.start_main_~x~4 51)) (and (<= ULTIMATE.start_main_~x~4 40) .cse21 (<= 40 ULTIMATE.start_main_~x~4) .cse20) (and (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99) .cse96 .cse97) (and .cse58 (<= ULTIMATE.start_main_~x~4 73) .cse59 (<= 73 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 92) .cse72 .cse73 (<= 92 ULTIMATE.start_main_~x~4)) (and .cse52 (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47) .cse53) (and (<= ULTIMATE.start_main_~x~4 7) .cse48 .cse49 (<= 7 ULTIMATE.start_main_~x~4)) (and (<= 86 ULTIMATE.start_main_~x~4) .cse38 .cse39 (<= ULTIMATE.start_main_~x~4 86)) (and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61) .cse45 .cse44) (and (<= 83 ULTIMATE.start_main_~x~4) .cse76 .cse77 (<= ULTIMATE.start_main_~x~4 83)) (and .cse30 (<= ULTIMATE.start_main_~x~4 10) .cse31 (<= 10 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 26) .cse98 .cse99 (<= 26 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 76) .cse1 (<= 76 ULTIMATE.start_main_~x~4) .cse0) (and (<= 49 ULTIMATE.start_main_~x~4) .cse94 .cse95 (<= ULTIMATE.start_main_~x~4 49)) (and .cse89 (<= ULTIMATE.start_main_~x~4 28) .cse88 (<= 28 ULTIMATE.start_main_~x~4)) (and .cse99 (<= 74 ULTIMATE.start_main_~x~4) .cse98 (<= ULTIMATE.start_main_~x~4 74)) (and (<= ULTIMATE.start_main_~x~4 91) .cse40 .cse41 (<= 91 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 33) .cse14 (<= 33 ULTIMATE.start_main_~x~4) .cse15) (and (<= ULTIMATE.start_main_~x~4 100) .cse92 .cse93 (<= 100 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 1) .cse96 .cse97 (<= 1 ULTIMATE.start_main_~x~4)) (and (<= 20 ULTIMATE.start_main_~x~4) .cse64 (<= ULTIMATE.start_main_~x~4 20) .cse65) (and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4) .cse24 .cse25) (and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) .cse87 .cse86))) [2018-09-26 21:47:33,445 INFO L422 ceAbstractionStarter]: At program point L46(lines 46 53) the Hoare annotation is: false [2018-09-26 21:47:33,447 INFO L422 ceAbstractionStarter]: At program point L36(lines 30 47) the Hoare annotation is: (let ((.cse30 (<= ULTIMATE.start_main_~y~4 34)) (.cse31 (<= 34 ULTIMATE.start_main_~y~4)) (.cse35 (<= ULTIMATE.start_main_~y~4 45)) (.cse34 (<= 45 ULTIMATE.start_main_~y~4)) (.cse32 (<= 19 ULTIMATE.start_main_~y~4)) (.cse33 (<= ULTIMATE.start_main_~y~4 19)) (.cse42 (<= ULTIMATE.start_main_~y~4 9)) (.cse43 (<= 9 ULTIMATE.start_main_~y~4)) (.cse36 (<= 5 ULTIMATE.start_main_~y~4)) (.cse37 (<= ULTIMATE.start_main_~y~4 5)) (.cse3 (<= 28 ULTIMATE.start_main_~y~4)) (.cse2 (<= ULTIMATE.start_main_~y~4 28)) (.cse52 (<= 4 ULTIMATE.start_main_~y~4)) (.cse53 (<= ULTIMATE.start_main_~y~4 4)) (.cse10 (<= 33 ULTIMATE.start_main_~y~4)) (.cse11 (<= ULTIMATE.start_main_~y~4 33)) (.cse22 (<= ULTIMATE.start_main_~y~4 23)) (.cse23 (<= 23 ULTIMATE.start_main_~y~4)) (.cse24 (<= ULTIMATE.start_main_~y~4 11)) (.cse25 (<= 11 ULTIMATE.start_main_~y~4)) (.cse26 (<= 20 ULTIMATE.start_main_~y~4)) (.cse27 (<= ULTIMATE.start_main_~y~4 20)) (.cse38 (<= ULTIMATE.start_main_~y~4 13)) (.cse39 (<= 13 ULTIMATE.start_main_~y~4)) (.cse67 (<= 37 ULTIMATE.start_main_~y~4)) (.cse66 (<= ULTIMATE.start_main_~y~4 37)) (.cse63 (<= 42 ULTIMATE.start_main_~y~4)) (.cse62 (<= ULTIMATE.start_main_~y~4 42)) (.cse72 (<= ULTIMATE.start_main_~y~4 38)) (.cse73 (<= 38 ULTIMATE.start_main_~y~4)) (.cse50 (<= ULTIMATE.start_main_~y~4 44)) (.cse51 (<= 44 ULTIMATE.start_main_~y~4)) (.cse65 (<= 46 ULTIMATE.start_main_~y~4)) (.cse64 (<= ULTIMATE.start_main_~y~4 46)) (.cse60 (<= ULTIMATE.start_main_~y~4 30)) (.cse61 (<= 30 ULTIMATE.start_main_~y~4)) (.cse78 (<= ULTIMATE.start_main_~y~4 7)) (.cse79 (<= 7 ULTIMATE.start_main_~y~4)) (.cse13 (<= ULTIMATE.start_main_~y~4 22)) (.cse12 (<= 22 ULTIMATE.start_main_~y~4)) (.cse20 (<= ULTIMATE.start_main_~y~4 10)) (.cse21 (<= 10 ULTIMATE.start_main_~y~4)) (.cse18 (<= 8 ULTIMATE.start_main_~y~4)) (.cse19 (<= ULTIMATE.start_main_~y~4 8)) (.cse40 (<= ULTIMATE.start_main_~y~4 27)) (.cse41 (<= 27 ULTIMATE.start_main_~y~4)) (.cse48 (<= 24 ULTIMATE.start_main_~y~4)) (.cse49 (<= ULTIMATE.start_main_~y~4 24)) (.cse81 (<= 49 ULTIMATE.start_main_~y~4)) (.cse80 (<= ULTIMATE.start_main_~y~4 49)) (.cse44 (<= 25 ULTIMATE.start_main_~y~4)) (.cse45 (<= ULTIMATE.start_main_~y~4 25)) (.cse86 (<= ULTIMATE.start_main_~y~4 1)) (.cse87 (<= 1 ULTIMATE.start_main_~y~4)) (.cse54 (<= 6 ULTIMATE.start_main_~y~4)) (.cse55 (<= ULTIMATE.start_main_~y~4 6)) (.cse56 (<= 16 ULTIMATE.start_main_~y~4)) (.cse57 (<= ULTIMATE.start_main_~y~4 16)) (.cse17 (<= ULTIMATE.start_main_~y~4 43)) (.cse16 (<= 43 ULTIMATE.start_main_~y~4)) (.cse70 (<= 31 ULTIMATE.start_main_~y~4)) (.cse71 (<= ULTIMATE.start_main_~y~4 31)) (.cse58 (<= ULTIMATE.start_main_~y~4 15)) (.cse59 (<= 15 ULTIMATE.start_main_~y~4)) (.cse76 (<= 14 ULTIMATE.start_main_~y~4)) (.cse77 (<= ULTIMATE.start_main_~y~4 14)) (.cse74 (<= ULTIMATE.start_main_~y~4 2)) (.cse75 (<= 2 ULTIMATE.start_main_~y~4)) (.cse94 (<= 47 ULTIMATE.start_main_~y~4)) (.cse95 (<= ULTIMATE.start_main_~y~4 47)) (.cse28 (<= 17 ULTIMATE.start_main_~y~4)) (.cse29 (<= ULTIMATE.start_main_~y~4 17)) (.cse5 (<= 29 ULTIMATE.start_main_~y~4)) (.cse4 (<= ULTIMATE.start_main_~y~4 29)) (.cse82 (<= 35 ULTIMATE.start_main_~y~4)) (.cse83 (<= ULTIMATE.start_main_~y~4 35)) (.cse96 (<= ULTIMATE.start_main_~y~4 26)) (.cse97 (<= 26 ULTIMATE.start_main_~y~4)) (.cse47 (<= ULTIMATE.start_main_~y~4 21)) (.cse46 (<= 21 ULTIMATE.start_main_~y~4)) (.cse84 (<= 32 ULTIMATE.start_main_~y~4)) (.cse85 (<= ULTIMATE.start_main_~y~4 32)) (.cse92 (<= ULTIMATE.start_main_~y~4 3)) (.cse93 (<= 3 ULTIMATE.start_main_~y~4)) (.cse0 (<= ULTIMATE.start_main_~y~4 41)) (.cse1 (<= 41 ULTIMATE.start_main_~y~4)) (.cse68 (<= 12 ULTIMATE.start_main_~y~4)) (.cse69 (<= ULTIMATE.start_main_~y~4 12)) (.cse14 (<= 18 ULTIMATE.start_main_~y~4)) (.cse15 (<= ULTIMATE.start_main_~y~4 18)) (.cse9 (<= ULTIMATE.start_main_~y~4 40)) (.cse8 (<= 40 ULTIMATE.start_main_~y~4)) (.cse6 (<= 39 ULTIMATE.start_main_~y~4)) (.cse7 (<= ULTIMATE.start_main_~y~4 39)) (.cse91 (<= ULTIMATE.start_main_~y~4 36)) (.cse90 (<= 36 ULTIMATE.start_main_~y~4)) (.cse88 (<= 48 ULTIMATE.start_main_~y~4)) (.cse89 (<= ULTIMATE.start_main_~y~4 48))) (or (and .cse0 (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58) .cse1) (and (<= ULTIMATE.start_main_~x~4 27) .cse2 (<= 27 ULTIMATE.start_main_~x~4) .cse3) (and (<= ULTIMATE.start_main_~x~4 28) .cse4 .cse5 (<= 28 ULTIMATE.start_main_~x~4)) (and (<= 38 ULTIMATE.start_main_~x~4) .cse6 (<= ULTIMATE.start_main_~x~4 38) .cse7) (and (<= ULTIMATE.start_main_~x~4 59) .cse8 .cse9 (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) .cse10 (<= ULTIMATE.start_main_~x~4 66) .cse11) (and (<= ULTIMATE.start_main_~x~4 77) .cse12 .cse13 (<= 77 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 100) (<= (+ ULTIMATE.start_main_~y~4 1) 0) (<= 100 ULTIMATE.start_main_~x~4)) (and .cse14 (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) .cse15) (and .cse16 (<= ULTIMATE.start_main_~x~4 42) .cse17 (<= 42 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 91) (<= 91 ULTIMATE.start_main_~x~4) .cse18 .cse19) (and .cse20 (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) .cse21) (and (<= ULTIMATE.start_main_~x~4 76) .cse22 .cse23 (<= 76 ULTIMATE.start_main_~x~4)) (and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88) .cse24 .cse25) (and (<= 79 ULTIMATE.start_main_~x~4) .cse26 (<= ULTIMATE.start_main_~x~4 79) .cse27) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) .cse28 .cse29) (and .cse30 .cse31 (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)) (and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4) .cse30 .cse31) (and .cse32 (<= ULTIMATE.start_main_~x~4 80) .cse33 (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44) .cse34 .cse35) (and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4) .cse35 .cse34) (and .cse36 .cse37 (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)) (and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) .cse32 .cse33) (and (<= 12 ULTIMATE.start_main_~x~4) .cse38 .cse39 (<= ULTIMATE.start_main_~x~4 12)) (and .cse40 (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72) .cse41) (and (<= ULTIMATE.start_main_~x~4 90) .cse42 (<= 90 ULTIMATE.start_main_~x~4) .cse43) (and .cse42 (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4) .cse43) (and .cse44 (<= ULTIMATE.start_main_~x~4 24) .cse45 (<= 24 ULTIMATE.start_main_~x~4)) (and .cse36 .cse37 (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)) (and (<= 20 ULTIMATE.start_main_~x~4) .cse46 (<= ULTIMATE.start_main_~x~4 20) .cse47) (and (<= ULTIMATE.start_main_~y~4 0) (<= 0 ULTIMATE.start_main_~y~4) (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99)) (and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4) .cse48 .cse49) (and .cse50 (<= 55 ULTIMATE.start_main_~x~4) .cse51 (<= ULTIMATE.start_main_~x~4 55)) (and .cse52 (<= 95 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 95) .cse53) (and (<= ULTIMATE.start_main_~x~4 5) .cse54 .cse55 (<= 5 ULTIMATE.start_main_~x~4)) (and (<= 15 ULTIMATE.start_main_~x~4) .cse56 .cse57 (<= ULTIMATE.start_main_~x~4 15)) (and .cse58 (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4) .cse59) (and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) .cse3 .cse2) (and .cse60 .cse61 (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)) (and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4) .cse62 .cse63) (and (<= 3 ULTIMATE.start_main_~x~4) .cse52 (<= ULTIMATE.start_main_~x~4 3) .cse53) (and .cse64 .cse65 (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)) (and (<= ULTIMATE.start_main_~x~4 32) .cse10 (<= 32 ULTIMATE.start_main_~x~4) .cse11) (and (<= ULTIMATE.start_main_~x~4 62) .cse66 .cse67 (<= 62 ULTIMATE.start_main_~x~4)) (and .cse22 .cse23 (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)) (and .cse68 (<= ULTIMATE.start_main_~x~4 87) .cse69 (<= 87 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 10) .cse24 .cse25 (<= 10 ULTIMATE.start_main_~x~4)) (and .cse26 (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19) .cse27) (and .cse38 .cse39 (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)) (and (<= ULTIMATE.start_main_~x~4 30) .cse70 (<= 30 ULTIMATE.start_main_~x~4) .cse71) (and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61) .cse72 .cse73) (and .cse74 (<= 97 ULTIMATE.start_main_~x~4) .cse75 (<= ULTIMATE.start_main_~x~4 97)) (and .cse76 .cse77 (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and .cse78 (<= ULTIMATE.start_main_~x~4 92) .cse79 (<= 92 ULTIMATE.start_main_~x~4)) (and (<= 36 ULTIMATE.start_main_~x~4) .cse67 .cse66 (<= ULTIMATE.start_main_~x~4 36)) (and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4) .cse80 .cse81) (and .cse63 .cse62 (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)) (and (<= ULTIMATE.start_main_~x~4 37) .cse72 .cse73 (<= 37 ULTIMATE.start_main_~x~4)) (and .cse82 (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4) .cse83) (and (<= ULTIMATE.start_main_~x~4 31) .cse84 (<= 31 ULTIMATE.start_main_~x~4) .cse85) (and (<= ULTIMATE.start_main_~y~4 50) (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49) (<= 50 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 43) .cse50 .cse51 (<= 43 ULTIMATE.start_main_~x~4)) (and .cse65 (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) .cse64) (and .cse60 (<= 29 ULTIMATE.start_main_~x~4) .cse61 (<= ULTIMATE.start_main_~x~4 29)) (and .cse78 (<= 6 ULTIMATE.start_main_~x~4) .cse79 (<= ULTIMATE.start_main_~x~4 6)) (and (<= ULTIMATE.start_main_~x~4 21) .cse13 (<= 21 ULTIMATE.start_main_~x~4) .cse12) (and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4) .cse86 .cse87) (and .cse20 (<= 9 ULTIMATE.start_main_~x~4) .cse21 (<= ULTIMATE.start_main_~x~4 9)) (and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4) .cse18 .cse19) (and .cse40 (<= ULTIMATE.start_main_~x~4 26) .cse41 (<= 26 ULTIMATE.start_main_~x~4)) (and (<= 51 ULTIMATE.start_main_~x~4) .cse88 .cse89 (<= ULTIMATE.start_main_~x~4 51)) (and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4) .cse48 .cse49) (and (<= 48 ULTIMATE.start_main_~x~4) .cse81 .cse80 (<= ULTIMATE.start_main_~x~4 48)) (and .cse44 (<= 74 ULTIMATE.start_main_~x~4) .cse45 (<= ULTIMATE.start_main_~x~4 74)) (and (<= 63 ULTIMATE.start_main_~x~4) .cse90 .cse91 (<= ULTIMATE.start_main_~x~4 63)) (and (<= ULTIMATE.start_main_~x~4 98) (<= 98 ULTIMATE.start_main_~x~4) .cse86 .cse87) (and .cse54 .cse55 (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and .cse92 .cse93 (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)) (and (<= ULTIMATE.start_main_~x~4 46) .cse94 (<= 46 ULTIMATE.start_main_~x~4) .cse95) (and (<= 83 ULTIMATE.start_main_~x~4) .cse56 .cse57 (<= ULTIMATE.start_main_~x~4 83)) (and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56) .cse17 .cse16) (and .cse70 (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) .cse71) (and .cse58 (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14) .cse59) (and .cse76 (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4) .cse77) (and .cse74 .cse75 (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)) (and .cse96 .cse97 (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) .cse94 .cse95) (and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4) .cse28 .cse29) (and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) .cse5 .cse4) (and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34) .cse82 .cse83) (and .cse96 (<= ULTIMATE.start_main_~x~4 25) .cse97 (<= 25 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4) .cse47 .cse46) (and (<= 67 ULTIMATE.start_main_~x~4) .cse84 .cse85 (<= ULTIMATE.start_main_~x~4 67)) (and .cse92 .cse93 (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 40) .cse0 (<= 40 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) .cse68 .cse69) (and .cse14 (<= ULTIMATE.start_main_~x~4 17) .cse15 (<= 17 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 39) .cse9 (<= 39 ULTIMATE.start_main_~x~4) .cse8) (and .cse6 .cse7 (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)) (and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4) .cse91 .cse90) (and .cse88 (<= 47 ULTIMATE.start_main_~x~4) .cse89 (<= ULTIMATE.start_main_~x~4 47)))) [2018-09-26 21:47:33,493 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:47:33 BoogieIcfgContainer [2018-09-26 21:47:33,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:47:33,495 INFO L168 Benchmark]: Toolchain (without parser) took 174028.95 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -204.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-26 21:47:33,496 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:47:33,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:47:33,497 INFO L168 Benchmark]: Boogie Preprocessor took 17.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:47:33,497 INFO L168 Benchmark]: RCFGBuilder took 226.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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-26 21:47:33,498 INFO L168 Benchmark]: TraceAbstraction took 173739.31 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -225.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-26 21:47:33,501 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 17.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 226.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 173739.31 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -225.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((24 <= main_~y~4 && main_~x~4 <= 24) && 24 <= main_~x~4) && main_~y~4 <= 24) || (((4 <= main_~y~4 && main_~x~4 <= 96) && 96 <= main_~x~4) && main_~y~4 <= 4)) || (((main_~x~4 <= 31 && 31 <= main_~y~4) && main_~y~4 <= 31) && 31 <= main_~x~4)) || (((18 <= main_~y~4 && 18 <= main_~x~4) && main_~x~4 <= 18) && main_~y~4 <= 18)) || (((main_~x~4 <= 46 && 46 <= main_~x~4) && main_~y~4 <= 46) && 46 <= main_~y~4)) || (((main_~y~4 <= 2 && 2 <= main_~y~4) && 2 <= main_~x~4) && main_~x~4 <= 2)) || (((58 <= main_~x~4 && 42 <= main_~y~4) && main_~y~4 <= 42) && main_~x~4 <= 58)) || (((67 <= main_~x~4 && 33 <= main_~y~4) && main_~y~4 <= 33) && main_~x~4 <= 67)) || (((19 <= main_~y~4 && 19 <= main_~x~4) && main_~y~4 <= 19) && main_~x~4 <= 19)) || (((main_~x~4 <= 5 && 5 <= main_~y~4) && main_~y~4 <= 5) && 5 <= main_~x~4)) || (((40 <= main_~y~4 && 60 <= main_~x~4) && main_~y~4 <= 40) && main_~x~4 <= 60)) || (((21 <= main_~y~4 && 79 <= main_~x~4) && main_~x~4 <= 79) && main_~y~4 <= 21)) || (((main_~x~4 <= 59 && main_~y~4 <= 41) && 41 <= main_~y~4) && 59 <= main_~x~4)) || (((main_~x~4 <= 54 && 46 <= main_~y~4) && main_~y~4 <= 46) && 54 <= main_~x~4)) || (((main_~x~4 <= 68 && 68 <= main_~x~4) && 32 <= main_~y~4) && main_~y~4 <= 32)) || (((71 <= main_~x~4 && main_~x~4 <= 71) && main_~y~4 <= 29) && 29 <= main_~y~4)) || (((2 <= main_~y~4 && main_~x~4 <= 98) && main_~y~4 <= 2) && 98 <= main_~x~4)) || (((main_~y~4 <= 10 && main_~x~4 <= 90) && 90 <= main_~x~4) && 10 <= main_~y~4)) || (((44 <= main_~x~4 && main_~x~4 <= 44) && main_~y~4 <= 44) && 44 <= main_~y~4)) || (((45 <= main_~y~4 && 45 <= main_~x~4) && main_~y~4 <= 45) && main_~x~4 <= 45)) || (((48 <= main_~x~4 && 48 <= main_~y~4) && main_~y~4 <= 48) && main_~x~4 <= 48)) || (((14 <= main_~y~4 && 14 <= main_~x~4) && main_~x~4 <= 14) && main_~y~4 <= 14)) || (((main_~y~4 <= 9 && 9 <= main_~x~4) && main_~x~4 <= 9) && 9 <= main_~y~4)) || (((12 <= main_~x~4 && 12 <= main_~y~4) && main_~y~4 <= 12) && main_~x~4 <= 12)) || (((39 <= main_~y~4 && main_~x~4 <= 39) && main_~y~4 <= 39) && 39 <= main_~x~4)) || (((43 <= main_~y~4 && 57 <= main_~x~4) && main_~x~4 <= 57) && main_~y~4 <= 43)) || (((main_~y~4 <= 7 && 7 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((main_~x~4 <= 21 && 21 <= main_~y~4) && 21 <= main_~x~4) && main_~y~4 <= 21)) || (((56 <= main_~x~4 && main_~x~4 <= 56) && main_~y~4 <= 44) && 44 <= main_~y~4)) || (((main_~y~4 <= 22 && main_~x~4 <= 78) && 78 <= main_~x~4) && 22 <= main_~y~4)) || (((main_~y~4 <= 42 && 42 <= main_~y~4) && main_~x~4 <= 42) && 42 <= main_~x~4)) || (((53 <= main_~x~4 && main_~x~4 <= 53) && 47 <= main_~y~4) && main_~y~4 <= 47)) || (((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~x~4) && 50 <= main_~y~4)) || (((34 <= main_~x~4 && main_~x~4 <= 34) && main_~y~4 <= 34) && 34 <= main_~y~4)) || (((37 <= main_~y~4 && main_~x~4 <= 37) && main_~y~4 <= 37) && 37 <= main_~x~4)) || (((88 <= main_~x~4 && main_~x~4 <= 88) && main_~y~4 <= 12) && 12 <= main_~y~4)) || (((main_~y~4 <= 27 && main_~x~4 <= 27) && 27 <= main_~y~4) && 27 <= main_~x~4)) || (((main_~y~4 <= 22 && main_~x~4 <= 22) && 22 <= main_~x~4) && 22 <= main_~y~4)) || (((main_~y~4 <= 30 && main_~x~4 <= 70) && 70 <= main_~x~4) && 30 <= main_~y~4)) || (((29 <= main_~x~4 && main_~y~4 <= 29) && 29 <= main_~y~4) && main_~x~4 <= 29)) || (((16 <= main_~y~4 && main_~x~4 <= 84) && main_~y~4 <= 16) && 84 <= main_~x~4)) || (((main_~x~4 <= 80 && 20 <= main_~y~4) && 80 <= main_~x~4) && main_~y~4 <= 20)) || (((main_~x~4 <= 64 && main_~y~4 <= 36) && 64 <= main_~x~4) && 36 <= main_~y~4)) || (((main_~x~4 <= 35 && 35 <= main_~y~4) && 35 <= main_~x~4) && main_~y~4 <= 35)) || (((main_~x~4 <= 16 && 16 <= main_~x~4) && 16 <= main_~y~4) && main_~y~4 <= 16)) || (((main_~y~4 <= 30 && main_~x~4 <= 30) && 30 <= main_~y~4) && 30 <= main_~x~4)) || (((main_~x~4 <= 75 && 75 <= main_~x~4) && main_~y~4 <= 25) && 25 <= main_~y~4)) || (((main_~x~4 <= 8 && 8 <= main_~y~4) && main_~y~4 <= 8) && 8 <= main_~x~4)) || (((38 <= main_~y~4 && main_~x~4 <= 62) && main_~y~4 <= 38) && 62 <= main_~x~4)) || (((4 <= main_~y~4 && main_~x~4 <= 4) && 4 <= main_~x~4) && main_~y~4 <= 4)) || (((main_~x~4 <= 17 && 17 <= main_~y~4) && main_~y~4 <= 17) && 17 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && main_~y~4 <= 18) && 18 <= main_~y~4)) || (((55 <= main_~x~4 && 45 <= main_~y~4) && main_~x~4 <= 55) && main_~y~4 <= 45)) || (((6 <= main_~y~4 && main_~y~4 <= 6) && main_~x~4 <= 94) && 94 <= main_~x~4)) || (((35 <= main_~y~4 && main_~y~4 <= 35) && 65 <= main_~x~4) && main_~x~4 <= 65)) || (((31 <= main_~y~4 && 69 <= main_~x~4) && main_~x~4 <= 69) && main_~y~4 <= 31)) || (((3 <= main_~x~4 && main_~y~4 <= 3) && 3 <= main_~y~4) && main_~x~4 <= 3)) || (((main_~y~4 <= 13 && main_~x~4 <= 87) && 13 <= main_~y~4) && 87 <= main_~x~4)) || (((38 <= main_~x~4 && main_~x~4 <= 38) && main_~y~4 <= 38) && 38 <= main_~y~4)) || (((main_~y~4 <= 13 && 13 <= main_~y~4) && main_~x~4 <= 13) && 13 <= main_~x~4)) || (((main_~x~4 <= 23 && 23 <= main_~x~4) && main_~y~4 <= 23) && 23 <= main_~y~4)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && 48 <= main_~y~4) && main_~y~4 <= 48)) || (((main_~x~4 <= 11 && 11 <= main_~x~4) && main_~y~4 <= 11) && 11 <= main_~y~4)) || (((main_~x~4 <= 32 && 32 <= main_~y~4) && 32 <= main_~x~4) && main_~y~4 <= 32)) || (((19 <= main_~y~4 && main_~x~4 <= 81) && 81 <= main_~x~4) && main_~y~4 <= 19)) || (((43 <= main_~y~4 && main_~x~4 <= 43) && 43 <= main_~x~4) && main_~y~4 <= 43)) || (((28 <= main_~y~4 && 72 <= main_~x~4) && main_~y~4 <= 28) && main_~x~4 <= 72)) || (((6 <= main_~x~4 && 6 <= main_~y~4) && main_~y~4 <= 6) && main_~x~4 <= 6)) || (((5 <= main_~y~4 && main_~y~4 <= 5) && 95 <= main_~x~4) && main_~x~4 <= 95)) || (((66 <= main_~x~4 && 34 <= main_~y~4) && main_~x~4 <= 66) && main_~y~4 <= 34)) || (((main_~y~4 <= 15 && 15 <= main_~y~4) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && main_~x~4 <= 0) && 0 <= main_~x~4)) || (((3 <= main_~y~4 && main_~y~4 <= 3) && 97 <= main_~x~4) && main_~x~4 <= 97)) || (((36 <= main_~x~4 && main_~y~4 <= 36) && main_~x~4 <= 36) && 36 <= main_~y~4)) || (((25 <= main_~y~4 && main_~y~4 <= 25) && main_~x~4 <= 25) && 25 <= main_~x~4)) || (((main_~x~4 <= 77 && 23 <= main_~y~4) && 77 <= main_~x~4) && main_~y~4 <= 23)) || (((63 <= main_~x~4 && main_~y~4 <= 37) && 37 <= main_~y~4) && main_~x~4 <= 63)) || (((main_~y~4 <= 15 && 15 <= main_~x~4) && 15 <= main_~y~4) && main_~x~4 <= 15)) || (((51 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 51)) || (((main_~x~4 <= 40 && main_~y~4 <= 40) && 40 <= main_~x~4) && 40 <= main_~y~4)) || (((99 <= main_~x~4 && main_~x~4 <= 99) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((main_~y~4 <= 27 && main_~x~4 <= 73) && 27 <= main_~y~4) && 73 <= main_~x~4)) || (((main_~x~4 <= 92 && 8 <= main_~y~4) && main_~y~4 <= 8) && 92 <= main_~x~4)) || (((47 <= main_~y~4 && 47 <= main_~x~4) && main_~x~4 <= 47) && main_~y~4 <= 47)) || (((main_~x~4 <= 7 && main_~y~4 <= 7) && 7 <= main_~y~4) && 7 <= main_~x~4)) || (((86 <= main_~x~4 && 14 <= main_~y~4) && main_~y~4 <= 14) && main_~x~4 <= 86)) || (((61 <= main_~x~4 && main_~x~4 <= 61) && main_~y~4 <= 39) && 39 <= main_~y~4)) || (((83 <= main_~x~4 && 17 <= main_~y~4) && main_~y~4 <= 17) && main_~x~4 <= 83)) || (((main_~y~4 <= 10 && main_~x~4 <= 10) && 10 <= main_~y~4) && 10 <= main_~x~4)) || (((main_~x~4 <= 26 && main_~y~4 <= 26) && 26 <= main_~y~4) && 26 <= main_~x~4)) || (((main_~x~4 <= 76 && main_~y~4 <= 24) && 76 <= main_~x~4) && 24 <= main_~y~4)) || (((49 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 49)) || (((main_~y~4 <= 28 && main_~x~4 <= 28) && 28 <= main_~y~4) && 28 <= main_~x~4)) || (((26 <= main_~y~4 && 74 <= main_~x~4) && main_~y~4 <= 26) && main_~x~4 <= 74)) || (((main_~x~4 <= 91 && main_~y~4 <= 9) && 9 <= main_~y~4) && 91 <= main_~x~4)) || (((main_~x~4 <= 33 && 33 <= main_~y~4) && 33 <= main_~x~4) && main_~y~4 <= 33)) || (((main_~x~4 <= 100 && main_~y~4 <= 0) && 0 <= main_~y~4) && 100 <= main_~x~4)) || (((main_~x~4 <= 1 && main_~y~4 <= 1) && 1 <= main_~y~4) && 1 <= main_~x~4)) || (((20 <= main_~x~4 && 20 <= main_~y~4) && main_~x~4 <= 20) && main_~y~4 <= 20)) || (((main_~x~4 <= 41 && 41 <= main_~x~4) && main_~y~4 <= 41) && 41 <= main_~y~4)) || (((main_~x~4 <= 89 && 89 <= main_~x~4) && 11 <= main_~y~4) && main_~y~4 <= 11) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 41 && 58 <= main_~x~4) && main_~x~4 <= 58) && 41 <= main_~y~4) || (((main_~x~4 <= 27 && main_~y~4 <= 28) && 27 <= main_~x~4) && 28 <= main_~y~4)) || (((main_~x~4 <= 28 && main_~y~4 <= 29) && 29 <= main_~y~4) && 28 <= main_~x~4)) || (((38 <= main_~x~4 && 39 <= main_~y~4) && main_~x~4 <= 38) && main_~y~4 <= 39)) || (((main_~x~4 <= 59 && 40 <= main_~y~4) && main_~y~4 <= 40) && 59 <= main_~x~4)) || (((66 <= main_~x~4 && 33 <= main_~y~4) && main_~x~4 <= 66) && main_~y~4 <= 33)) || (((main_~x~4 <= 77 && 22 <= main_~y~4) && main_~y~4 <= 22) && 77 <= main_~x~4)) || ((main_~x~4 <= 100 && main_~y~4 + 1 <= 0) && 100 <= main_~x~4)) || (((18 <= main_~y~4 && main_~x~4 <= 81) && 81 <= main_~x~4) && main_~y~4 <= 18)) || (((43 <= main_~y~4 && main_~x~4 <= 42) && main_~y~4 <= 43) && 42 <= main_~x~4)) || (((main_~x~4 <= 91 && 91 <= main_~x~4) && 8 <= main_~y~4) && main_~y~4 <= 8)) || (((main_~y~4 <= 10 && main_~x~4 <= 89) && 89 <= main_~x~4) && 10 <= main_~y~4)) || (((main_~x~4 <= 76 && main_~y~4 <= 23) && 23 <= main_~y~4) && 76 <= main_~x~4)) || (((88 <= main_~x~4 && main_~x~4 <= 88) && main_~y~4 <= 11) && 11 <= main_~y~4)) || (((79 <= main_~x~4 && 20 <= main_~y~4) && main_~x~4 <= 79) && main_~y~4 <= 20)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && 17 <= main_~y~4) && main_~y~4 <= 17)) || (((main_~y~4 <= 34 && 34 <= main_~y~4) && 65 <= main_~x~4) && main_~x~4 <= 65)) || (((main_~x~4 <= 33 && 33 <= main_~x~4) && main_~y~4 <= 34) && 34 <= main_~y~4)) || (((19 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 19) && 80 <= main_~x~4)) || (((44 <= main_~x~4 && main_~x~4 <= 44) && 45 <= main_~y~4) && main_~y~4 <= 45)) || (((main_~x~4 <= 54 && 54 <= main_~x~4) && main_~y~4 <= 45) && 45 <= main_~y~4)) || (((5 <= main_~y~4 && main_~y~4 <= 5) && main_~x~4 <= 4) && 4 <= main_~x~4)) || (((18 <= main_~x~4 && main_~x~4 <= 18) && 19 <= main_~y~4) && main_~y~4 <= 19)) || (((12 <= main_~x~4 && main_~y~4 <= 13) && 13 <= main_~y~4) && main_~x~4 <= 12)) || (((main_~y~4 <= 27 && 72 <= main_~x~4) && main_~x~4 <= 72) && 27 <= main_~y~4)) || (((main_~x~4 <= 90 && main_~y~4 <= 9) && 90 <= main_~x~4) && 9 <= main_~y~4)) || (((main_~y~4 <= 9 && main_~x~4 <= 8) && 8 <= main_~x~4) && 9 <= main_~y~4)) || (((25 <= main_~y~4 && main_~x~4 <= 24) && main_~y~4 <= 25) && 24 <= main_~x~4)) || (((5 <= main_~y~4 && main_~y~4 <= 5) && main_~x~4 <= 94) && 94 <= main_~x~4)) || (((20 <= main_~x~4 && 21 <= main_~y~4) && main_~x~4 <= 20) && main_~y~4 <= 21)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && 99 <= main_~x~4) && main_~x~4 <= 99)) || (((main_~x~4 <= 75 && 75 <= main_~x~4) && 24 <= main_~y~4) && main_~y~4 <= 24)) || (((main_~y~4 <= 44 && 55 <= main_~x~4) && 44 <= main_~y~4) && main_~x~4 <= 55)) || (((4 <= main_~y~4 && 95 <= main_~x~4) && main_~x~4 <= 95) && main_~y~4 <= 4)) || (((main_~x~4 <= 5 && 6 <= main_~y~4) && main_~y~4 <= 6) && 5 <= main_~x~4)) || (((15 <= main_~x~4 && 16 <= main_~y~4) && main_~y~4 <= 16) && main_~x~4 <= 15)) || (((main_~y~4 <= 15 && main_~x~4 <= 84) && 84 <= main_~x~4) && 15 <= main_~y~4)) || (((71 <= main_~x~4 && main_~x~4 <= 71) && 28 <= main_~y~4) && main_~y~4 <= 28)) || (((main_~y~4 <= 30 && 30 <= main_~y~4) && 69 <= main_~x~4) && main_~x~4 <= 69)) || (((main_~x~4 <= 41 && 41 <= main_~x~4) && main_~y~4 <= 42) && 42 <= main_~y~4)) || (((3 <= main_~x~4 && 4 <= main_~y~4) && main_~x~4 <= 3) && main_~y~4 <= 4)) || (((main_~y~4 <= 46 && 46 <= main_~y~4) && 45 <= main_~x~4) && main_~x~4 <= 45)) || (((main_~x~4 <= 32 && 33 <= main_~y~4) && 32 <= main_~x~4) && main_~y~4 <= 33)) || (((main_~x~4 <= 62 && main_~y~4 <= 37) && 37 <= main_~y~4) && 62 <= main_~x~4)) || (((main_~y~4 <= 23 && 23 <= main_~y~4) && main_~x~4 <= 22) && 22 <= main_~x~4)) || (((12 <= main_~y~4 && main_~x~4 <= 87) && main_~y~4 <= 12) && 87 <= main_~x~4)) || (((main_~x~4 <= 10 && main_~y~4 <= 11) && 11 <= main_~y~4) && 10 <= main_~x~4)) || (((20 <= main_~y~4 && 19 <= main_~x~4) && main_~x~4 <= 19) && main_~y~4 <= 20)) || (((main_~y~4 <= 13 && 13 <= main_~y~4) && 86 <= main_~x~4) && main_~x~4 <= 86)) || (((main_~x~4 <= 30 && 31 <= main_~y~4) && 30 <= main_~x~4) && main_~y~4 <= 31)) || (((61 <= main_~x~4 && main_~x~4 <= 61) && main_~y~4 <= 38) && 38 <= main_~y~4)) || (((main_~y~4 <= 2 && 97 <= main_~x~4) && 2 <= main_~y~4) && main_~x~4 <= 97)) || (((14 <= main_~y~4 && main_~y~4 <= 14) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((main_~y~4 <= 7 && main_~x~4 <= 92) && 7 <= main_~y~4) && 92 <= main_~x~4)) || (((36 <= main_~x~4 && 37 <= main_~y~4) && main_~y~4 <= 37) && main_~x~4 <= 36)) || (((main_~x~4 <= 50 && 50 <= main_~x~4) && main_~y~4 <= 49) && 49 <= main_~y~4)) || (((42 <= main_~y~4 && main_~y~4 <= 42) && 57 <= main_~x~4) && main_~x~4 <= 57)) || (((main_~x~4 <= 37 && main_~y~4 <= 38) && 38 <= main_~y~4) && 37 <= main_~x~4)) || (((35 <= main_~y~4 && main_~x~4 <= 64) && 64 <= main_~x~4) && main_~y~4 <= 35)) || (((main_~x~4 <= 31 && 32 <= main_~y~4) && 31 <= main_~x~4) && main_~y~4 <= 32)) || (((main_~y~4 <= 50 && 49 <= main_~x~4) && main_~x~4 <= 49) && 50 <= main_~y~4)) || (((main_~x~4 <= 43 && main_~y~4 <= 44) && 44 <= main_~y~4) && 43 <= main_~x~4)) || (((46 <= main_~y~4 && 53 <= main_~x~4) && main_~x~4 <= 53) && main_~y~4 <= 46)) || (((main_~y~4 <= 30 && 29 <= main_~x~4) && 30 <= main_~y~4) && main_~x~4 <= 29)) || (((main_~y~4 <= 7 && 6 <= main_~x~4) && 7 <= main_~y~4) && main_~x~4 <= 6)) || (((main_~x~4 <= 21 && main_~y~4 <= 22) && 21 <= main_~x~4) && 22 <= main_~y~4)) || (((main_~x~4 <= 0 && 0 <= main_~x~4) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((main_~y~4 <= 10 && 9 <= main_~x~4) && 10 <= main_~y~4) && main_~x~4 <= 9)) || (((main_~x~4 <= 7 && 7 <= main_~x~4) && 8 <= main_~y~4) && main_~y~4 <= 8)) || (((main_~y~4 <= 27 && main_~x~4 <= 26) && 27 <= main_~y~4) && 26 <= main_~x~4)) || (((51 <= main_~x~4 && 48 <= main_~y~4) && main_~y~4 <= 48) && main_~x~4 <= 51)) || (((main_~x~4 <= 23 && 23 <= main_~x~4) && 24 <= main_~y~4) && main_~y~4 <= 24)) || (((48 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 48)) || (((25 <= main_~y~4 && 74 <= main_~x~4) && main_~y~4 <= 25) && main_~x~4 <= 74)) || (((63 <= main_~x~4 && 36 <= main_~y~4) && main_~y~4 <= 36) && main_~x~4 <= 63)) || (((main_~x~4 <= 98 && 98 <= main_~x~4) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((6 <= main_~y~4 && main_~y~4 <= 6) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((main_~y~4 <= 3 && 3 <= main_~y~4) && 2 <= main_~x~4) && main_~x~4 <= 2)) || (((main_~x~4 <= 46 && 47 <= main_~y~4) && 46 <= main_~x~4) && main_~y~4 <= 47)) || (((83 <= main_~x~4 && 16 <= main_~y~4) && main_~y~4 <= 16) && main_~x~4 <= 83)) || (((56 <= main_~x~4 && main_~x~4 <= 56) && main_~y~4 <= 43) && 43 <= main_~y~4)) || (((31 <= main_~y~4 && main_~x~4 <= 68) && 68 <= main_~x~4) && main_~y~4 <= 31)) || (((main_~y~4 <= 15 && 14 <= main_~x~4) && main_~x~4 <= 14) && 15 <= main_~y~4)) || (((14 <= main_~y~4 && main_~x~4 <= 13) && 13 <= main_~x~4) && main_~y~4 <= 14)) || (((main_~y~4 <= 2 && 2 <= main_~y~4) && main_~x~4 <= 1) && 1 <= main_~x~4)) || (((main_~y~4 <= 26 && 26 <= main_~y~4) && main_~x~4 <= 73) && 73 <= main_~x~4)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && 47 <= main_~y~4) && main_~y~4 <= 47)) || (((main_~x~4 <= 16 && 16 <= main_~x~4) && 17 <= main_~y~4) && main_~y~4 <= 17)) || (((main_~x~4 <= 70 && 70 <= main_~x~4) && 29 <= main_~y~4) && main_~y~4 <= 29)) || (((34 <= main_~x~4 && main_~x~4 <= 34) && 35 <= main_~y~4) && main_~y~4 <= 35)) || (((main_~y~4 <= 26 && main_~x~4 <= 25) && 26 <= main_~y~4) && 25 <= main_~x~4)) || (((main_~x~4 <= 78 && 78 <= main_~x~4) && main_~y~4 <= 21) && 21 <= main_~y~4)) || (((67 <= main_~x~4 && 32 <= main_~y~4) && main_~y~4 <= 32) && main_~x~4 <= 67)) || (((main_~y~4 <= 3 && 3 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4)) || (((main_~x~4 <= 40 && main_~y~4 <= 41) && 40 <= main_~x~4) && 41 <= main_~y~4)) || (((main_~x~4 <= 11 && 11 <= main_~x~4) && 12 <= main_~y~4) && main_~y~4 <= 12)) || (((18 <= main_~y~4 && main_~x~4 <= 17) && main_~y~4 <= 18) && 17 <= main_~x~4)) || (((main_~x~4 <= 39 && main_~y~4 <= 40) && 39 <= main_~x~4) && 40 <= main_~y~4)) || (((39 <= main_~y~4 && main_~y~4 <= 39) && 60 <= main_~x~4) && main_~x~4 <= 60)) || (((main_~x~4 <= 35 && 35 <= main_~x~4) && main_~y~4 <= 36) && 36 <= main_~y~4)) || (((48 <= main_~y~4 && 47 <= main_~x~4) && main_~y~4 <= 48) && main_~x~4 <= 47) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 173.6s OverallTime, 39 OverallIterations, 102 TraceHistogramMax, 87.8s AutomataDifference, 0.0s DeadEndRemovalTime, 31.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 193 SDtfs, 1016 SDslu, 3114 SDs, 0 SdLazy, 14299 SolverSat, 1306 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4920 GetRequests, 3596 SyntacticMatches, 2 SemanticMatches, 1322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2806occurred in iteration=38, 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: 14.8s AutomataMinimizationTime, 39 MinimizatonAttempts, 1976 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 205 NumberOfFragments, 2628 HoareAnnotationTreeSize, 3 FomulaSimplifications, 520258123268 FormulaSimplificationTreeSizeReduction, 9.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1637333720 FormulaSimplificationTreeSizeReductionInter, 21.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 32.9s InterpolantComputationTime, 7404 NumberOfCodeBlocks, 7392 NumberOfCodeBlocksAsserted, 1004 NumberOfCheckSat, 7329 ConstructedInterpolants, 0 QuantifiedInterpolants, 2564783 SizeOfPredicates, 36 NumberOfNonLiveVariables, 10962 ConjunctsInSsa, 1250 ConjunctsInUnsatCore, 75 InterpolantComputations, 3 PerfectInterpolantSequences, 178432/260286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-47-33-537.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-47-33-537.csv Received shutdown request...