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-00a8621 [2018-09-30 10:47:00,207 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:47:00,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:47:00,228 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:47:00,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:47:00,229 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:47:00,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:47:00,234 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:47:00,236 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:47:00,238 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:47:00,240 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:47:00,241 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:47:00,242 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:47:00,243 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:47:00,244 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:47:00,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:47:00,253 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:47:00,258 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:47:00,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:47:00,265 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:47:00,266 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:47:00,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:47:00,275 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:47:00,275 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:47:00,276 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:47:00,277 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:47:00,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:47:00,279 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:47:00,282 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:47:00,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:47:00,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:47:00,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:47:00,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:47:00,285 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:47:00,286 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:47:00,286 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:47:00,287 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-30 10:47:00,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:47:00,304 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:47:00,304 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:47:00,305 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:47:00,308 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:47:00,308 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:47:00,308 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:47:00,309 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:47:00,309 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:47:00,309 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:47:00,309 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:47:00,309 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:47:00,310 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:47:00,310 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:47:00,310 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:47:00,310 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:47:00,312 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:47:00,312 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:47:00,312 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:47:00,312 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:47:00,313 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:47:00,313 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:47:00,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:47:00,313 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:47:00,313 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:47:00,314 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:47:00,314 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:47:00,314 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:47:00,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:47:00,314 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:47:00,315 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:47:00,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:47:00,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:47:00,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:47:00,404 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:47:00,405 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:47:00,406 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-30 10:47:00,406 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-30 10:47:00,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:47:00,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:47:00,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:47:00,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:47:00,469 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:47:00,489 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 30.09 10:47:00" (1/1) ... [2018-09-30 10:47:00,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 30.09 10:47:00" (1/1) ... [2018-09-30 10:47:00,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:47:00,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:47:00,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:47:00,508 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:47:00,519 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 30.09 10:47:00" (1/1) ... [2018-09-30 10:47:00,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 30.09 10:47:00" (1/1) ... [2018-09-30 10:47:00,520 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 30.09 10:47:00" (1/1) ... [2018-09-30 10:47:00,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 30.09 10:47:00" (1/1) ... [2018-09-30 10:47:00,523 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 30.09 10:47:00" (1/1) ... [2018-09-30 10:47:00,525 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 30.09 10:47:00" (1/1) ... [2018-09-30 10:47:00,526 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 30.09 10:47:00" (1/1) ... [2018-09-30 10:47:00,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:47:00,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:47:00,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:47:00,528 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:47:00,529 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 30.09 10:47:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:47:00,600 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-30 10:47:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:47:00,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:47:00,783 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:47:00,784 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:47:00 BoogieIcfgContainer [2018-09-30 10:47:00,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:47:00,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:47:00,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:47:00,789 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:47:00,789 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 30.09 10:47:00" (1/2) ... [2018-09-30 10:47:00,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce12058 and model type gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:47:00, skipping insertion in model container [2018-09-30 10:47:00,791 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 30.09 10:47:00" (2/2) ... [2018-09-30 10:47:00,792 INFO L112 eAbstractionObserver]: Analyzing ICFG gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-09-30 10:47:00,802 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:47:00,810 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:47:00,864 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:47:00,864 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:47:00,865 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:47:00,865 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:47:00,865 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:47:00,865 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:47:00,865 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:47:00,866 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:47:00,866 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:47:00,881 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-09-30 10:47:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 10:47:00,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:00,889 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 10:47:00,890 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:00,901 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash 928682, now seen corresponding path program 1 times [2018-09-30 10:47:00,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:00,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:00,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:00,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:00,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:47:01,079 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:47:01,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:47:01,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:47:01,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:47:01,098 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:01,100 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-09-30 10:47:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:01,341 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2018-09-30 10:47:01,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:47:01,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-30 10:47:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:01,353 INFO L225 Difference]: With dead ends: 15 [2018-09-30 10:47:01,353 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 10:47:01,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 10:47:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2018-09-30 10:47:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-30 10:47:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-09-30 10:47:01,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2018-09-30 10:47:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:01,398 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-09-30 10:47:01,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:47:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-09-30 10:47:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 10:47:01,398 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:01,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 10:47:01,399 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:01,402 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:01,402 INFO L82 PathProgramCache]: Analyzing trace with hash 930604, now seen corresponding path program 1 times [2018-09-30 10:47:01,402 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:01,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:01,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:01,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:01,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:47:01,474 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:47:01,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:47:01,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:47:01,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:47:01,477 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:01,477 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-09-30 10:47:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:01,611 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-09-30 10:47:01,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:47:01,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-30 10:47:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:01,613 INFO L225 Difference]: With dead ends: 11 [2018-09-30 10:47:01,613 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 10:47:01,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 10:47:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-30 10:47:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 10:47:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-09-30 10:47:01,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 4 [2018-09-30 10:47:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:01,618 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-09-30 10:47:01,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:47:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-09-30 10:47:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:47:01,619 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:01,619 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 10:47:01,619 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:01,620 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash 487293020, now seen corresponding path program 1 times [2018-09-30 10:47:01,620 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:01,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:01,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:01,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:01,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:01,694 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-30 10:47:01,695 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:01,695 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:01,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:01,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:01,790 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-30 10:47:01,811 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:01,811 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-09-30 10:47:01,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:47:01,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:47:01,812 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:01,812 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2018-09-30 10:47:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:02,171 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-09-30 10:47:02,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:47:02,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-30 10:47:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:02,172 INFO L225 Difference]: With dead ends: 19 [2018-09-30 10:47:02,173 INFO L226 Difference]: Without dead ends: 12 [2018-09-30 10:47:02,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-30 10:47:02,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-09-30 10:47:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 10:47:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-09-30 10:47:02,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2018-09-30 10:47:02,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:02,178 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-09-30 10:47:02,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:47:02,179 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-09-30 10:47:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:47:02,179 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:02,180 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2018-09-30 10:47:02,180 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:02,180 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:02,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1912214646, now seen corresponding path program 2 times [2018-09-30 10:47:02,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:02,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:02,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:02,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:02,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:02,259 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-30 10:47:02,260 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:02,260 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:02,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:47:02,287 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:47:02,288 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:02,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:02,322 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-30 10:47:02,344 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:02,344 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 10:47:02,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:47:02,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:47:02,346 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:02,347 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 5 states. [2018-09-30 10:47:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:02,601 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-09-30 10:47:02,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:47:02,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-09-30 10:47:02,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:02,604 INFO L225 Difference]: With dead ends: 21 [2018-09-30 10:47:02,604 INFO L226 Difference]: Without dead ends: 14 [2018-09-30 10:47:02,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-30 10:47:02,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-30 10:47:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 10:47:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-09-30 10:47:02,609 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2018-09-30 10:47:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:02,610 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-09-30 10:47:02,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:47:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-09-30 10:47:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:47:02,611 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:02,611 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1] [2018-09-30 10:47:02,611 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:02,612 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:02,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1167329808, now seen corresponding path program 3 times [2018-09-30 10:47:02,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:02,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:02,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:02,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:02,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:02,695 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-30 10:47:02,696 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:02,696 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:02,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:47:02,719 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-09-30 10:47:02,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:02,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:02,799 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-30 10:47:02,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:02,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-30 10:47:02,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:47:02,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:47:02,821 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:02,821 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 6 states. [2018-09-30 10:47:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:02,924 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2018-09-30 10:47:02,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:47:02,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-09-30 10:47:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:02,926 INFO L225 Difference]: With dead ends: 23 [2018-09-30 10:47:02,926 INFO L226 Difference]: Without dead ends: 16 [2018-09-30 10:47:02,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-30 10:47:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-09-30 10:47:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-30 10:47:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-09-30 10:47:02,932 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-09-30 10:47:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:02,933 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-09-30 10:47:02,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:47:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-09-30 10:47:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:47:02,934 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:02,934 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1] [2018-09-30 10:47:02,934 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:02,935 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:02,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1702428374, now seen corresponding path program 4 times [2018-09-30 10:47:02,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:02,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:02,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:02,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:02,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:03,249 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-30 10:47:03,251 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:03,252 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:03,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:47:03,314 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:47:03,315 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:03,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:03,527 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-30 10:47:03,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:03,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:47:03,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:47:03,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:47:03,549 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:03,550 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 7 states. [2018-09-30 10:47:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:03,638 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-09-30 10:47:03,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:47:03,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-09-30 10:47:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:03,640 INFO L225 Difference]: With dead ends: 25 [2018-09-30 10:47:03,640 INFO L226 Difference]: Without dead ends: 18 [2018-09-30 10:47:03,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:03,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-30 10:47:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-30 10:47:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 10:47:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-09-30 10:47:03,646 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2018-09-30 10:47:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:03,646 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-09-30 10:47:03,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:47:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-09-30 10:47:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:47:03,647 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:03,648 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1] [2018-09-30 10:47:03,648 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:03,648 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:03,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2123930052, now seen corresponding path program 5 times [2018-09-30 10:47:03,649 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:03,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:03,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:03,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:03,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:03,769 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-30 10:47:03,770 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:03,770 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:03,787 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:47:03,802 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-30 10:47:03,802 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:03,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:03,853 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-30 10:47:03,873 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:03,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:47:03,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:47:03,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:47:03,874 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:03,875 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 8 states. [2018-09-30 10:47:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:03,969 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-09-30 10:47:03,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:47:03,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:47:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:03,971 INFO L225 Difference]: With dead ends: 27 [2018-09-30 10:47:03,971 INFO L226 Difference]: Without dead ends: 20 [2018-09-30 10:47:03,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:03,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-30 10:47:03,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-09-30 10:47:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-30 10:47:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-09-30 10:47:03,977 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-09-30 10:47:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:03,977 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-09-30 10:47:03,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:47:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-09-30 10:47:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:47:03,978 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:03,978 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 2, 1, 1, 1] [2018-09-30 10:47:03,979 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:03,979 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:03,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1532595234, now seen corresponding path program 6 times [2018-09-30 10:47:03,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:03,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:03,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:03,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:03,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:04,101 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-30 10:47:04,102 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:04,102 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:04,110 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:47:04,144 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-09-30 10:47:04,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:04,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:04,213 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-30 10:47:04,237 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:04,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-09-30 10:47:04,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:47:04,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:47:04,238 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:04,238 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 10 states. [2018-09-30 10:47:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:04,476 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-09-30 10:47:04,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:47:04,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-30 10:47:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:04,479 INFO L225 Difference]: With dead ends: 31 [2018-09-30 10:47:04,479 INFO L226 Difference]: Without dead ends: 24 [2018-09-30 10:47:04,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-30 10:47:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-09-30 10:47:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-30 10:47:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-09-30 10:47:04,486 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2018-09-30 10:47:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:04,487 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-09-30 10:47:04,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:47:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-09-30 10:47:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:47:04,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:04,488 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 2, 1, 1, 1] [2018-09-30 10:47:04,488 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:04,489 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:04,489 INFO L82 PathProgramCache]: Analyzing trace with hash -677024622, now seen corresponding path program 7 times [2018-09-30 10:47:04,489 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:04,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:04,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:04,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:04,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:04,790 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-30 10:47:04,790 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:04,790 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:04,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:04,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:04,881 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-30 10:47:04,903 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:04,903 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-09-30 10:47:04,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:47:04,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:47:04,904 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:04,904 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2018-09-30 10:47:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:05,007 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-09-30 10:47:05,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:47:05,008 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-09-30 10:47:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:05,009 INFO L225 Difference]: With dead ends: 33 [2018-09-30 10:47:05,009 INFO L226 Difference]: Without dead ends: 26 [2018-09-30 10:47:05,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:05,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-30 10:47:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-30 10:47:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 10:47:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-09-30 10:47:05,017 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2018-09-30 10:47:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:05,018 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-09-30 10:47:05,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:47:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-09-30 10:47:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 10:47:05,019 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:05,019 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 2, 1, 1, 1] [2018-09-30 10:47:05,019 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:05,019 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:05,020 INFO L82 PathProgramCache]: Analyzing trace with hash -305542356, now seen corresponding path program 8 times [2018-09-30 10:47:05,020 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:05,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:05,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:05,178 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-30 10:47:05,178 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:05,179 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:05,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:47:05,215 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:47:05,216 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:05,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:05,288 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-30 10:47:05,309 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:05,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-09-30 10:47:05,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:47:05,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:47:05,310 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:05,311 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 12 states. [2018-09-30 10:47:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:05,497 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-09-30 10:47:05,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:47:05,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-09-30 10:47:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:05,499 INFO L225 Difference]: With dead ends: 35 [2018-09-30 10:47:05,499 INFO L226 Difference]: Without dead ends: 28 [2018-09-30 10:47:05,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-30 10:47:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-09-30 10:47:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-30 10:47:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-09-30 10:47:05,506 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2018-09-30 10:47:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:05,507 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-09-30 10:47:05,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:47:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-09-30 10:47:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-30 10:47:05,508 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:05,508 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 2, 1, 1, 1] [2018-09-30 10:47:05,509 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:05,509 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:05,509 INFO L82 PathProgramCache]: Analyzing trace with hash 206629702, now seen corresponding path program 9 times [2018-09-30 10:47:05,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:05,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:05,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:05,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:05,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:05,622 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-30 10:47:05,622 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:05,623 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:05,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:47:05,657 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-09-30 10:47:05,657 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:05,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:05,725 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-30 10:47:05,745 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:05,745 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 16 [2018-09-30 10:47:05,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:47:05,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:47:05,746 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:05,747 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 16 states. [2018-09-30 10:47:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:06,688 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-09-30 10:47:06,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:47:06,690 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-09-30 10:47:06,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:06,691 INFO L225 Difference]: With dead ends: 42 [2018-09-30 10:47:06,691 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 10:47:06,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 10:47:06,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-09-30 10:47:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 10:47:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-09-30 10:47:06,704 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 26 [2018-09-30 10:47:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:06,704 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-09-30 10:47:06,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:47:06,706 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-09-30 10:47:06,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:47:06,707 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:06,707 INFO L375 BasicCegarLoop]: trace histogram [13, 11, 3, 1, 1, 1] [2018-09-30 10:47:06,708 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:06,708 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:06,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2094433928, now seen corresponding path program 10 times [2018-09-30 10:47:06,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:06,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:06,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:06,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:06,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:06,928 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-30 10:47:06,930 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:06,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:06,945 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:47:06,992 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:47:06,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:06,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:07,346 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-30 10:47:07,376 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:07,376 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-09-30 10:47:07,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:47:07,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:47:07,377 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:07,378 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 14 states. [2018-09-30 10:47:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:07,530 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-09-30 10:47:07,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:47:07,531 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-09-30 10:47:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:07,532 INFO L225 Difference]: With dead ends: 43 [2018-09-30 10:47:07,532 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 10:47:07,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 10:47:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-30 10:47:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-30 10:47:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-09-30 10:47:07,544 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2018-09-30 10:47:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:07,544 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-09-30 10:47:07,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:47:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-09-30 10:47:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-30 10:47:07,545 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:07,546 INFO L375 BasicCegarLoop]: trace histogram [14, 12, 3, 1, 1, 1] [2018-09-30 10:47:07,546 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:07,546 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2026201582, now seen corresponding path program 11 times [2018-09-30 10:47:07,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:07,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:07,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:07,761 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-30 10:47:07,761 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:07,761 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:07,769 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:47:07,798 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-09-30 10:47:07,798 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:07,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:07,875 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-30 10:47:07,898 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:07,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-09-30 10:47:07,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:47:07,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:47:07,899 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:07,899 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 15 states. [2018-09-30 10:47:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:08,547 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-09-30 10:47:08,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:47:08,547 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-09-30 10:47:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:08,548 INFO L225 Difference]: With dead ends: 45 [2018-09-30 10:47:08,548 INFO L226 Difference]: Without dead ends: 36 [2018-09-30 10:47:08,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:08,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-30 10:47:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-09-30 10:47:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 10:47:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-09-30 10:47:08,559 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2018-09-30 10:47:08,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:08,559 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-09-30 10:47:08,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:47:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-09-30 10:47:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:47:08,560 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:08,561 INFO L375 BasicCegarLoop]: trace histogram [15, 13, 3, 1, 1, 1] [2018-09-30 10:47:08,561 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:08,561 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:08,561 INFO L82 PathProgramCache]: Analyzing trace with hash -879426516, now seen corresponding path program 12 times [2018-09-30 10:47:08,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:08,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:08,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:08,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:08,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:08,723 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-30 10:47:08,723 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:08,723 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:08,731 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:47:08,788 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-09-30 10:47:08,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:08,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:09,004 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-30 10:47:09,025 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:09,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-09-30 10:47:09,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-30 10:47:09,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-30 10:47:09,026 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:09,026 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 30 states. [2018-09-30 10:47:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:11,310 INFO L93 Difference]: Finished difference Result 124 states and 175 transitions. [2018-09-30 10:47:11,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 10:47:11,312 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-09-30 10:47:11,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:11,313 INFO L225 Difference]: With dead ends: 124 [2018-09-30 10:47:11,313 INFO L226 Difference]: Without dead ends: 115 [2018-09-30 10:47:11,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:11,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-30 10:47:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 59. [2018-09-30 10:47:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-30 10:47:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2018-09-30 10:47:11,334 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 34 [2018-09-30 10:47:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:11,334 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2018-09-30 10:47:11,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-30 10:47:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2018-09-30 10:47:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-30 10:47:11,336 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:11,336 INFO L375 BasicCegarLoop]: trace histogram [27, 14, 14, 1, 1, 1] [2018-09-30 10:47:11,336 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:11,336 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:11,337 INFO L82 PathProgramCache]: Analyzing trace with hash 407632846, now seen corresponding path program 13 times [2018-09-30 10:47:11,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:11,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:11,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:11,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:11,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:11,714 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-30 10:47:11,714 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:11,714 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:11,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:11,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:11,837 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-30 10:47:11,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:11,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-09-30 10:47:11,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:47:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:47:11,859 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:11,859 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 17 states. [2018-09-30 10:47:12,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:12,068 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2018-09-30 10:47:12,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:47:12,068 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-09-30 10:47:12,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:12,070 INFO L225 Difference]: With dead ends: 93 [2018-09-30 10:47:12,070 INFO L226 Difference]: Without dead ends: 62 [2018-09-30 10:47:12,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:12,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-30 10:47:12,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-30 10:47:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-30 10:47:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2018-09-30 10:47:12,091 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 58 [2018-09-30 10:47:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:12,091 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2018-09-30 10:47:12,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:47:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2018-09-30 10:47:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-30 10:47:12,093 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:12,093 INFO L375 BasicCegarLoop]: trace histogram [28, 15, 14, 1, 1, 1] [2018-09-30 10:47:12,093 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:12,093 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:12,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1594791272, now seen corresponding path program 14 times [2018-09-30 10:47:12,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:12,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:12,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:12,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:12,222 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-30 10:47:12,223 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:12,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:12,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:47:12,275 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:47:12,275 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:12,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:12,430 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-30 10:47:12,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:12,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-09-30 10:47:12,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:47:12,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:47:12,452 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:12,452 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 18 states. [2018-09-30 10:47:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:12,884 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-09-30 10:47:12,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:47:12,884 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-09-30 10:47:12,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:12,886 INFO L225 Difference]: With dead ends: 95 [2018-09-30 10:47:12,886 INFO L226 Difference]: Without dead ends: 64 [2018-09-30 10:47:12,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-30 10:47:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-09-30 10:47:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-30 10:47:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2018-09-30 10:47:12,908 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 60 [2018-09-30 10:47:12,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:12,908 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2018-09-30 10:47:12,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:47:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2018-09-30 10:47:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-30 10:47:12,909 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:12,910 INFO L375 BasicCegarLoop]: trace histogram [29, 16, 14, 1, 1, 1] [2018-09-30 10:47:12,910 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:12,910 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:12,910 INFO L82 PathProgramCache]: Analyzing trace with hash -7262078, now seen corresponding path program 15 times [2018-09-30 10:47:12,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:12,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:12,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:12,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:12,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:13,105 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-30 10:47:13,105 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:13,106 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:13,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:47:13,227 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-09-30 10:47:13,227 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:13,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:13,720 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-30 10:47:13,740 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:13,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-09-30 10:47:13,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-30 10:47:13,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-30 10:47:13,741 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:13,741 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 36 states. [2018-09-30 10:47:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:16,366 INFO L93 Difference]: Finished difference Result 184 states and 258 transitions. [2018-09-30 10:47:16,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 10:47:16,366 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 62 [2018-09-30 10:47:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:16,367 INFO L225 Difference]: With dead ends: 184 [2018-09-30 10:47:16,367 INFO L226 Difference]: Without dead ends: 153 [2018-09-30 10:47:16,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-30 10:47:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 71. [2018-09-30 10:47:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-30 10:47:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2018-09-30 10:47:16,393 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 62 [2018-09-30 10:47:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:16,393 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2018-09-30 10:47:16,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-30 10:47:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2018-09-30 10:47:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-30 10:47:16,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:16,395 INFO L375 BasicCegarLoop]: trace histogram [33, 17, 17, 1, 1, 1] [2018-09-30 10:47:16,395 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:16,395 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:16,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1463704604, now seen corresponding path program 16 times [2018-09-30 10:47:16,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:16,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:16,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:16,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:16,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:17,004 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-30 10:47:17,005 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:17,005 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:17,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:47:17,049 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:47:17,049 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:17,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:17,384 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-30 10:47:17,405 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:17,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 34] total 34 [2018-09-30 10:47:17,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-30 10:47:17,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-30 10:47:17,406 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:17,406 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 35 states. [2018-09-30 10:47:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:17,821 INFO L93 Difference]: Finished difference Result 141 states and 191 transitions. [2018-09-30 10:47:17,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 10:47:17,821 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2018-09-30 10:47:17,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:17,822 INFO L225 Difference]: With dead ends: 141 [2018-09-30 10:47:17,822 INFO L226 Difference]: Without dead ends: 104 [2018-09-30 10:47:17,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:17,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-30 10:47:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-09-30 10:47:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-30 10:47:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2018-09-30 10:47:17,853 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 70 [2018-09-30 10:47:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:17,853 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2018-09-30 10:47:17,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-30 10:47:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2018-09-30 10:47:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-30 10:47:17,855 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:17,855 INFO L375 BasicCegarLoop]: trace histogram [49, 33, 17, 1, 1, 1] [2018-09-30 10:47:17,855 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:17,856 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1622311300, now seen corresponding path program 17 times [2018-09-30 10:47:17,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:17,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:17,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:17,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:17,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:18,221 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-30 10:47:18,221 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:18,221 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:18,229 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:47:18,308 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2018-09-30 10:47:18,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:18,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:18,480 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-30 10:47:18,502 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:18,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-09-30 10:47:18,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-30 10:47:18,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-30 10:47:18,503 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:18,503 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand 36 states. [2018-09-30 10:47:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:19,079 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2018-09-30 10:47:19,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 10:47:19,080 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 102 [2018-09-30 10:47:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:19,081 INFO L225 Difference]: With dead ends: 143 [2018-09-30 10:47:19,081 INFO L226 Difference]: Without dead ends: 106 [2018-09-30 10:47:19,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:19,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-30 10:47:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-30 10:47:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-30 10:47:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2018-09-30 10:47:19,117 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 102 [2018-09-30 10:47:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:19,117 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2018-09-30 10:47:19,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-30 10:47:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2018-09-30 10:47:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-30 10:47:19,119 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:19,119 INFO L375 BasicCegarLoop]: trace histogram [50, 34, 17, 1, 1, 1] [2018-09-30 10:47:19,119 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:19,119 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:19,120 INFO L82 PathProgramCache]: Analyzing trace with hash 627612702, now seen corresponding path program 18 times [2018-09-30 10:47:19,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:19,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:19,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:19,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:19,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:19,402 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-30 10:47:19,402 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:19,403 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:19,411 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:47:19,494 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2018-09-30 10:47:19,495 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:19,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:19,634 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-30 10:47:19,655 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:19,655 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-09-30 10:47:19,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-30 10:47:19,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-30 10:47:19,656 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:19,656 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 37 states. [2018-09-30 10:47:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:20,066 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2018-09-30 10:47:20,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 10:47:20,067 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 104 [2018-09-30 10:47:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:20,068 INFO L225 Difference]: With dead ends: 145 [2018-09-30 10:47:20,068 INFO L226 Difference]: Without dead ends: 108 [2018-09-30 10:47:20,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-30 10:47:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-09-30 10:47:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-30 10:47:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2018-09-30 10:47:20,104 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 104 [2018-09-30 10:47:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:20,104 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2018-09-30 10:47:20,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-30 10:47:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2018-09-30 10:47:20,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-30 10:47:20,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:20,105 INFO L375 BasicCegarLoop]: trace histogram [51, 35, 17, 1, 1, 1] [2018-09-30 10:47:20,105 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:20,106 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:20,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1795000264, now seen corresponding path program 19 times [2018-09-30 10:47:20,106 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:20,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:20,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:20,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:20,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:21,099 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-30 10:47:21,099 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:21,099 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:21,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:21,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:21,298 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-30 10:47:21,319 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:21,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-09-30 10:47:21,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-30 10:47:21,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-30 10:47:21,320 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:21,320 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand 38 states. [2018-09-30 10:47:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:21,790 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2018-09-30 10:47:21,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 10:47:21,791 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 106 [2018-09-30 10:47:21,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:21,792 INFO L225 Difference]: With dead ends: 147 [2018-09-30 10:47:21,792 INFO L226 Difference]: Without dead ends: 110 [2018-09-30 10:47:21,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-30 10:47:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-09-30 10:47:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 10:47:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2018-09-30 10:47:21,821 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 106 [2018-09-30 10:47:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:21,821 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2018-09-30 10:47:21,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-30 10:47:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2018-09-30 10:47:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-30 10:47:21,822 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:21,822 INFO L375 BasicCegarLoop]: trace histogram [52, 36, 17, 1, 1, 1] [2018-09-30 10:47:21,823 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:21,823 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:21,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2053786158, now seen corresponding path program 20 times [2018-09-30 10:47:21,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:21,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:21,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:22,185 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-30 10:47:22,186 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:22,186 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:22,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:47:22,247 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:47:22,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:22,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:22,463 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-30 10:47:22,483 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:22,483 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-09-30 10:47:22,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-30 10:47:22,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-30 10:47:22,484 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:22,484 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 39 states. [2018-09-30 10:47:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:22,923 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2018-09-30 10:47:22,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 10:47:22,925 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 108 [2018-09-30 10:47:22,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:22,926 INFO L225 Difference]: With dead ends: 149 [2018-09-30 10:47:22,926 INFO L226 Difference]: Without dead ends: 112 [2018-09-30 10:47:22,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-30 10:47:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-09-30 10:47:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-30 10:47:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2018-09-30 10:47:22,959 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 108 [2018-09-30 10:47:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:22,959 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2018-09-30 10:47:22,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-30 10:47:22,959 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2018-09-30 10:47:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-30 10:47:22,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:22,960 INFO L375 BasicCegarLoop]: trace histogram [53, 37, 17, 1, 1, 1] [2018-09-30 10:47:22,961 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:22,961 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:22,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1638927124, now seen corresponding path program 21 times [2018-09-30 10:47:22,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:22,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:22,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:22,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:22,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:24,149 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-30 10:47:24,149 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:24,149 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:24,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:47:24,244 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-09-30 10:47:24,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:24,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:25,990 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-30 10:47:26,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:26,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-09-30 10:47:26,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-30 10:47:26,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-30 10:47:26,014 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:26,014 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand 78 states. [2018-09-30 10:47:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:35,146 INFO L93 Difference]: Finished difference Result 886 states and 1299 transitions. [2018-09-30 10:47:35,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-30 10:47:35,146 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 110 [2018-09-30 10:47:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:35,150 INFO L225 Difference]: With dead ends: 886 [2018-09-30 10:47:35,151 INFO L226 Difference]: Without dead ends: 849 [2018-09-30 10:47:35,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-09-30 10:47:35,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 155. [2018-09-30 10:47:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-30 10:47:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 193 transitions. [2018-09-30 10:47:35,269 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 193 transitions. Word has length 110 [2018-09-30 10:47:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:35,269 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 193 transitions. [2018-09-30 10:47:35,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-30 10:47:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 193 transitions. [2018-09-30 10:47:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-30 10:47:35,270 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:35,271 INFO L375 BasicCegarLoop]: trace histogram [75, 38, 38, 1, 1, 1] [2018-09-30 10:47:35,271 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:35,271 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:35,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1253490050, now seen corresponding path program 22 times [2018-09-30 10:47:35,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:35,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:35,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:35,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:35,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:35,770 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-30 10:47:35,770 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:35,770 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:35,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:47:35,864 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:47:35,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:35,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:36,061 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-30 10:47:36,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:36,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-09-30 10:47:36,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-30 10:47:36,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-30 10:47:36,084 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:36,084 INFO L87 Difference]: Start difference. First operand 155 states and 193 transitions. Second operand 41 states. [2018-09-30 10:47:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:36,589 INFO L93 Difference]: Finished difference Result 237 states and 314 transitions. [2018-09-30 10:47:36,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 10:47:36,590 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2018-09-30 10:47:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:36,591 INFO L225 Difference]: With dead ends: 237 [2018-09-30 10:47:36,591 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 10:47:36,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 10:47:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-30 10:47:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-30 10:47:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2018-09-30 10:47:36,697 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 154 [2018-09-30 10:47:36,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:36,697 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2018-09-30 10:47:36,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-30 10:47:36,697 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2018-09-30 10:47:36,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-30 10:47:36,698 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:36,698 INFO L375 BasicCegarLoop]: trace histogram [76, 39, 38, 1, 1, 1] [2018-09-30 10:47:36,698 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:36,698 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:36,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1772805096, now seen corresponding path program 23 times [2018-09-30 10:47:36,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:36,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:36,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:36,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:37,016 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-30 10:47:37,016 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:37,016 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:37,024 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:47:37,607 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 77 check-sat command(s) [2018-09-30 10:47:37,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:37,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:37,793 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-30 10:47:37,814 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:37,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-09-30 10:47:37,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-30 10:47:37,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-30 10:47:37,815 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:37,815 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand 42 states. [2018-09-30 10:47:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:38,300 INFO L93 Difference]: Finished difference Result 239 states and 316 transitions. [2018-09-30 10:47:38,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 10:47:38,300 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 156 [2018-09-30 10:47:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:38,302 INFO L225 Difference]: With dead ends: 239 [2018-09-30 10:47:38,302 INFO L226 Difference]: Without dead ends: 160 [2018-09-30 10:47:38,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-30 10:47:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-09-30 10:47:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-30 10:47:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 197 transitions. [2018-09-30 10:47:38,411 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 197 transitions. Word has length 156 [2018-09-30 10:47:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:38,412 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 197 transitions. [2018-09-30 10:47:38,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-30 10:47:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 197 transitions. [2018-09-30 10:47:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-30 10:47:38,413 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:38,413 INFO L375 BasicCegarLoop]: trace histogram [77, 40, 38, 1, 1, 1] [2018-09-30 10:47:38,413 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:38,413 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:38,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1676609330, now seen corresponding path program 24 times [2018-09-30 10:47:38,414 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:38,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:38,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:38,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:38,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:38,704 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-30 10:47:38,704 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:38,704 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:38,712 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:47:38,847 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 77 check-sat command(s) [2018-09-30 10:47:38,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:38,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:39,000 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-30 10:47:39,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:39,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-09-30 10:47:39,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-30 10:47:39,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-30 10:47:39,023 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:39,023 INFO L87 Difference]: Start difference. First operand 159 states and 197 transitions. Second operand 43 states. [2018-09-30 10:47:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:39,787 INFO L93 Difference]: Finished difference Result 241 states and 318 transitions. [2018-09-30 10:47:39,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 10:47:39,787 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 158 [2018-09-30 10:47:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:39,789 INFO L225 Difference]: With dead ends: 241 [2018-09-30 10:47:39,789 INFO L226 Difference]: Without dead ends: 162 [2018-09-30 10:47:39,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:39,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-30 10:47:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-30 10:47:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-30 10:47:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 199 transitions. [2018-09-30 10:47:39,889 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 199 transitions. Word has length 158 [2018-09-30 10:47:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:39,889 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 199 transitions. [2018-09-30 10:47:39,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-30 10:47:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2018-09-30 10:47:39,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-30 10:47:39,890 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:39,890 INFO L375 BasicCegarLoop]: trace histogram [78, 41, 38, 1, 1, 1] [2018-09-30 10:47:39,890 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:39,891 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:39,891 INFO L82 PathProgramCache]: Analyzing trace with hash 849120204, now seen corresponding path program 25 times [2018-09-30 10:47:39,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:39,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:39,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:39,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:39,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:40,193 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-30 10:47:40,193 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:40,193 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:40,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:40,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:40,490 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-30 10:47:40,510 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:40,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-09-30 10:47:40,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-30 10:47:40,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-30 10:47:40,511 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:40,511 INFO L87 Difference]: Start difference. First operand 161 states and 199 transitions. Second operand 44 states. [2018-09-30 10:47:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:41,833 INFO L93 Difference]: Finished difference Result 243 states and 320 transitions. [2018-09-30 10:47:41,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 10:47:41,834 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 160 [2018-09-30 10:47:41,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:41,835 INFO L225 Difference]: With dead ends: 243 [2018-09-30 10:47:41,835 INFO L226 Difference]: Without dead ends: 164 [2018-09-30 10:47:41,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-30 10:47:41,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-09-30 10:47:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-30 10:47:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 201 transitions. [2018-09-30 10:47:41,996 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 201 transitions. Word has length 160 [2018-09-30 10:47:41,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:41,996 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 201 transitions. [2018-09-30 10:47:41,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-30 10:47:41,996 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 201 transitions. [2018-09-30 10:47:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-30 10:47:41,997 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:41,997 INFO L375 BasicCegarLoop]: trace histogram [79, 42, 38, 1, 1, 1] [2018-09-30 10:47:41,998 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:41,998 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:41,998 INFO L82 PathProgramCache]: Analyzing trace with hash 201019878, now seen corresponding path program 26 times [2018-09-30 10:47:41,998 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:41,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:41,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:41,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:41,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:42,431 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-30 10:47:42,431 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:42,431 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:42,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:47:42,513 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:47:42,513 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:42,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:42,698 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-30 10:47:42,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:42,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-09-30 10:47:42,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-30 10:47:42,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-30 10:47:42,720 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:42,720 INFO L87 Difference]: Start difference. First operand 163 states and 201 transitions. Second operand 45 states. [2018-09-30 10:47:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:43,343 INFO L93 Difference]: Finished difference Result 245 states and 322 transitions. [2018-09-30 10:47:43,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 10:47:43,344 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 162 [2018-09-30 10:47:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:43,345 INFO L225 Difference]: With dead ends: 245 [2018-09-30 10:47:43,345 INFO L226 Difference]: Without dead ends: 166 [2018-09-30 10:47:43,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:43,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-30 10:47:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-30 10:47:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-30 10:47:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 203 transitions. [2018-09-30 10:47:43,507 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 203 transitions. Word has length 162 [2018-09-30 10:47:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:43,508 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 203 transitions. [2018-09-30 10:47:43,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-30 10:47:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 203 transitions. [2018-09-30 10:47:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-30 10:47:43,509 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:43,509 INFO L375 BasicCegarLoop]: trace histogram [80, 43, 38, 1, 1, 1] [2018-09-30 10:47:43,509 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:43,509 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:43,510 INFO L82 PathProgramCache]: Analyzing trace with hash 146864512, now seen corresponding path program 27 times [2018-09-30 10:47:43,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:43,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:43,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:43,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:43,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:43,981 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-30 10:47:43,982 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:43,982 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:43,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:47:44,196 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-09-30 10:47:44,196 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:44,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:44,496 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-30 10:47:44,525 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:44,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-09-30 10:47:44,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-30 10:47:44,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-30 10:47:44,527 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:44,527 INFO L87 Difference]: Start difference. First operand 165 states and 203 transitions. Second operand 46 states. [2018-09-30 10:47:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:45,107 INFO L93 Difference]: Finished difference Result 247 states and 324 transitions. [2018-09-30 10:47:45,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-30 10:47:45,107 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 164 [2018-09-30 10:47:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:45,108 INFO L225 Difference]: With dead ends: 247 [2018-09-30 10:47:45,109 INFO L226 Difference]: Without dead ends: 168 [2018-09-30 10:47:45,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-30 10:47:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-09-30 10:47:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-30 10:47:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2018-09-30 10:47:45,219 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 164 [2018-09-30 10:47:45,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:45,219 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2018-09-30 10:47:45,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-30 10:47:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2018-09-30 10:47:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-30 10:47:45,220 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:45,220 INFO L375 BasicCegarLoop]: trace histogram [81, 44, 38, 1, 1, 1] [2018-09-30 10:47:45,220 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:45,221 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash -356834662, now seen corresponding path program 28 times [2018-09-30 10:47:45,221 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:45,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:45,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:45,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:45,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:45,698 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-30 10:47:45,699 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:45,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:45,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:47:45,782 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:47:45,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:45,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:46,552 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-30 10:47:46,590 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:46,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-09-30 10:47:46,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-30 10:47:46,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-30 10:47:46,592 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:46,592 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand 47 states. [2018-09-30 10:47:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:47,772 INFO L93 Difference]: Finished difference Result 249 states and 326 transitions. [2018-09-30 10:47:47,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 10:47:47,774 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 166 [2018-09-30 10:47:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:47,775 INFO L225 Difference]: With dead ends: 249 [2018-09-30 10:47:47,775 INFO L226 Difference]: Without dead ends: 170 [2018-09-30 10:47:47,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-30 10:47:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-30 10:47:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-30 10:47:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 207 transitions. [2018-09-30 10:47:47,882 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 207 transitions. Word has length 166 [2018-09-30 10:47:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:47,882 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 207 transitions. [2018-09-30 10:47:47,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-30 10:47:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2018-09-30 10:47:47,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-30 10:47:47,883 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:47,883 INFO L375 BasicCegarLoop]: trace histogram [82, 45, 38, 1, 1, 1] [2018-09-30 10:47:47,883 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:47,883 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:47,883 INFO L82 PathProgramCache]: Analyzing trace with hash 919563572, now seen corresponding path program 29 times [2018-09-30 10:47:47,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:47,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:47,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:47,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:47,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:48,435 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-30 10:47:48,436 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:48,436 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:48,443 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:47:48,647 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) [2018-09-30 10:47:48,648 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:48,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:49,990 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-30 10:47:50,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:50,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-09-30 10:47:50,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-30 10:47:50,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-30 10:47:50,012 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:50,012 INFO L87 Difference]: Start difference. First operand 169 states and 207 transitions. Second operand 48 states. [2018-09-30 10:47:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:50,668 INFO L93 Difference]: Finished difference Result 251 states and 328 transitions. [2018-09-30 10:47:50,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 10:47:50,669 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 168 [2018-09-30 10:47:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:50,670 INFO L225 Difference]: With dead ends: 251 [2018-09-30 10:47:50,670 INFO L226 Difference]: Without dead ends: 172 [2018-09-30 10:47:50,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-30 10:47:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-09-30 10:47:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-30 10:47:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 209 transitions. [2018-09-30 10:47:50,790 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 209 transitions. Word has length 168 [2018-09-30 10:47:50,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:50,791 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 209 transitions. [2018-09-30 10:47:50,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-30 10:47:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 209 transitions. [2018-09-30 10:47:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-30 10:47:50,792 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:50,792 INFO L375 BasicCegarLoop]: trace histogram [83, 46, 38, 1, 1, 1] [2018-09-30 10:47:50,792 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:50,792 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:50,792 INFO L82 PathProgramCache]: Analyzing trace with hash -822380210, now seen corresponding path program 30 times [2018-09-30 10:47:50,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:50,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:50,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:50,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:50,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:51,288 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-30 10:47:51,288 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:51,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:51,296 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:47:51,444 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 84 check-sat command(s) [2018-09-30 10:47:51,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:51,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:51,667 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-30 10:47:51,688 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:51,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-09-30 10:47:51,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-30 10:47:51,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-30 10:47:51,689 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:51,689 INFO L87 Difference]: Start difference. First operand 171 states and 209 transitions. Second operand 49 states. [2018-09-30 10:47:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:52,492 INFO L93 Difference]: Finished difference Result 253 states and 330 transitions. [2018-09-30 10:47:52,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 10:47:52,493 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 170 [2018-09-30 10:47:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:52,494 INFO L225 Difference]: With dead ends: 253 [2018-09-30 10:47:52,494 INFO L226 Difference]: Without dead ends: 174 [2018-09-30 10:47:52,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-30 10:47:52,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-30 10:47:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-30 10:47:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 211 transitions. [2018-09-30 10:47:52,606 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 211 transitions. Word has length 170 [2018-09-30 10:47:52,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:52,606 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 211 transitions. [2018-09-30 10:47:52,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-30 10:47:52,606 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 211 transitions. [2018-09-30 10:47:52,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-30 10:47:52,607 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:52,607 INFO L375 BasicCegarLoop]: trace histogram [84, 47, 38, 1, 1, 1] [2018-09-30 10:47:52,608 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:52,608 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:52,608 INFO L82 PathProgramCache]: Analyzing trace with hash 206890728, now seen corresponding path program 31 times [2018-09-30 10:47:52,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:52,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:52,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:53,025 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-30 10:47:53,026 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:53,026 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:53,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:53,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:53,306 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-30 10:47:53,328 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:53,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-09-30 10:47:53,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 10:47:53,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 10:47:53,329 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:53,329 INFO L87 Difference]: Start difference. First operand 173 states and 211 transitions. Second operand 50 states. [2018-09-30 10:47:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:54,055 INFO L93 Difference]: Finished difference Result 255 states and 332 transitions. [2018-09-30 10:47:54,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 10:47:54,056 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 172 [2018-09-30 10:47:54,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:54,057 INFO L225 Difference]: With dead ends: 255 [2018-09-30 10:47:54,057 INFO L226 Difference]: Without dead ends: 176 [2018-09-30 10:47:54,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:54,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-30 10:47:54,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-09-30 10:47:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-30 10:47:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 213 transitions. [2018-09-30 10:47:54,222 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 213 transitions. Word has length 172 [2018-09-30 10:47:54,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:54,222 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 213 transitions. [2018-09-30 10:47:54,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 10:47:54,222 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 213 transitions. [2018-09-30 10:47:54,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-30 10:47:54,223 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:54,224 INFO L375 BasicCegarLoop]: trace histogram [85, 48, 38, 1, 1, 1] [2018-09-30 10:47:54,224 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:54,224 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:54,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1493784066, now seen corresponding path program 32 times [2018-09-30 10:47:54,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:54,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:54,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:54,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:54,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:54,899 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-30 10:47:54,900 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:54,900 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:54,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:47:54,981 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:47:54,981 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:54,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:55,180 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-30 10:47:55,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:55,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-09-30 10:47:55,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-30 10:47:55,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-30 10:47:55,202 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:55,203 INFO L87 Difference]: Start difference. First operand 175 states and 213 transitions. Second operand 51 states. [2018-09-30 10:47:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:55,859 INFO L93 Difference]: Finished difference Result 257 states and 334 transitions. [2018-09-30 10:47:55,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 10:47:55,859 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 174 [2018-09-30 10:47:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:55,861 INFO L225 Difference]: With dead ends: 257 [2018-09-30 10:47:55,861 INFO L226 Difference]: Without dead ends: 178 [2018-09-30 10:47:55,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-30 10:47:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-30 10:47:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-30 10:47:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 215 transitions. [2018-09-30 10:47:55,963 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 215 transitions. Word has length 174 [2018-09-30 10:47:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:55,964 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 215 transitions. [2018-09-30 10:47:55,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-30 10:47:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 215 transitions. [2018-09-30 10:47:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-30 10:47:55,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:55,965 INFO L375 BasicCegarLoop]: trace histogram [86, 49, 38, 1, 1, 1] [2018-09-30 10:47:55,965 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:55,965 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:55,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1247700636, now seen corresponding path program 33 times [2018-09-30 10:47:55,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:55,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:55,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:55,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:55,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:56,828 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-30 10:47:56,828 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:56,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:56,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:47:57,003 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-09-30 10:47:57,004 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:57,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:57,252 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-30 10:47:57,272 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:57,272 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-09-30 10:47:57,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-30 10:47:57,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-30 10:47:57,273 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:57,273 INFO L87 Difference]: Start difference. First operand 177 states and 215 transitions. Second operand 52 states. [2018-09-30 10:47:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:57,968 INFO L93 Difference]: Finished difference Result 294 states and 371 transitions. [2018-09-30 10:47:57,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 10:47:57,970 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 176 [2018-09-30 10:47:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:57,971 INFO L225 Difference]: With dead ends: 294 [2018-09-30 10:47:57,971 INFO L226 Difference]: Without dead ends: 215 [2018-09-30 10:47:57,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-30 10:47:58,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 179. [2018-09-30 10:47:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-30 10:47:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 217 transitions. [2018-09-30 10:47:58,089 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 217 transitions. Word has length 176 [2018-09-30 10:47:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:58,089 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 217 transitions. [2018-09-30 10:47:58,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-30 10:47:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 217 transitions. [2018-09-30 10:47:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-30 10:47:58,090 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:58,090 INFO L375 BasicCegarLoop]: trace histogram [87, 50, 38, 1, 1, 1] [2018-09-30 10:47:58,090 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:58,090 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:58,091 INFO L82 PathProgramCache]: Analyzing trace with hash 984725686, now seen corresponding path program 34 times [2018-09-30 10:47:58,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:58,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:58,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:58,757 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-30 10:47:58,758 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:58,758 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:58,766 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:47:58,849 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:47:58,849 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:58,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:59,177 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-30 10:47:59,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:59,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-09-30 10:47:59,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-30 10:47:59,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-30 10:47:59,198 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:59,199 INFO L87 Difference]: Start difference. First operand 179 states and 217 transitions. Second operand 53 states. [2018-09-30 10:48:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:48:03,006 INFO L93 Difference]: Finished difference Result 1182 states and 1726 transitions. [2018-09-30 10:48:03,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 10:48:03,006 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 178 [2018-09-30 10:48:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:48:03,014 INFO L225 Difference]: With dead ends: 1182 [2018-09-30 10:48:03,014 INFO L226 Difference]: Without dead ends: 1180 [2018-09-30 10:48:03,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:48:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2018-09-30 10:48:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 205. [2018-09-30 10:48:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-30 10:48:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 256 transitions. [2018-09-30 10:48:03,327 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 256 transitions. Word has length 178 [2018-09-30 10:48:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:48:03,327 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 256 transitions. [2018-09-30 10:48:03,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-30 10:48:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 256 transitions. [2018-09-30 10:48:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-30 10:48:03,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:48:03,329 INFO L375 BasicCegarLoop]: trace histogram [100, 51, 50, 1, 1, 1] [2018-09-30 10:48:03,330 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:48:03,330 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:48:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1557903122, now seen corresponding path program 35 times [2018-09-30 10:48:03,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:48:03,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:48:03,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:48:03,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:48:03,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:48:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:48:05,972 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-30 10:48:05,973 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:48:05,973 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:48:05,980 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:48:06,203 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 101 check-sat command(s) [2018-09-30 10:48:06,203 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:48:06,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:48:06,768 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-30 10:48:06,798 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:48:06,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-09-30 10:48:06,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-30 10:48:06,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-30 10:48:06,799 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:48:06,800 INFO L87 Difference]: Start difference. First operand 205 states and 256 transitions. Second operand 55 states. [2018-09-30 10:48:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:48:41,176 INFO L93 Difference]: Finished difference Result 3007 states and 4385 transitions. [2018-09-30 10:48:41,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 10:48:41,176 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-09-30 10:48:41,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:48:41,188 INFO L225 Difference]: With dead ends: 3007 [2018-09-30 10:48:41,189 INFO L226 Difference]: Without dead ends: 2902 [2018-09-30 10:48:41,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:48:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2018-09-30 10:48:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2804. [2018-09-30 10:48:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2804 states. [2018-09-30 10:48:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 2904 transitions. [2018-09-30 10:48:47,646 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 2904 transitions. Word has length 204 [2018-09-30 10:48:47,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:48:47,646 INFO L480 AbstractCegarLoop]: Abstraction has 2804 states and 2904 transitions. [2018-09-30 10:48:47,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-30 10:48:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 2904 transitions. [2018-09-30 10:48:47,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-30 10:48:47,647 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:48:47,648 INFO L375 BasicCegarLoop]: trace histogram [101, 52, 50, 1, 1, 1] [2018-09-30 10:48:47,648 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:48:47,648 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:48:47,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1798736390, now seen corresponding path program 36 times [2018-09-30 10:48:47,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:48:47,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:48:47,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:48:47,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:48:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:48:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:48:48,655 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-30 10:48:48,656 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:48:48,656 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:48:48,664 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:48:48,869 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 102 check-sat command(s) [2018-09-30 10:48:48,869 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:48:48,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:48:49,431 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-30 10:48:49,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:48:49,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-09-30 10:48:49,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-30 10:48:49,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-30 10:48:49,453 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:48:49,453 INFO L87 Difference]: Start difference. First operand 2804 states and 2904 transitions. Second operand 54 states. [2018-09-30 10:49:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:49:00,300 INFO L93 Difference]: Finished difference Result 5611 states and 5812 transitions. [2018-09-30 10:49:00,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 10:49:00,301 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 206 [2018-09-30 10:49:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:49:00,312 INFO L225 Difference]: With dead ends: 5611 [2018-09-30 10:49:00,312 INFO L226 Difference]: Without dead ends: 2806 [2018-09-30 10:49:00,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:49:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2018-09-30 10:49:06,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2806. [2018-09-30 10:49:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2806 states. [2018-09-30 10:49:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 2906 transitions. [2018-09-30 10:49:06,631 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 2906 transitions. Word has length 206 [2018-09-30 10:49:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:49:06,631 INFO L480 AbstractCegarLoop]: Abstraction has 2806 states and 2906 transitions. [2018-09-30 10:49:06,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-30 10:49:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 2906 transitions. [2018-09-30 10:49:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-30 10:49:06,632 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:49:06,632 INFO L375 BasicCegarLoop]: trace histogram [102, 52, 51, 1, 1, 1] [2018-09-30 10:49:06,632 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:49:06,632 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:49:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash -132992352, now seen corresponding path program 37 times [2018-09-30 10:49:06,633 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:49:06,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:49:06,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:49:06,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:49:06,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:49:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:49:07,210 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-30 10:49:07,211 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:49:07,211 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-09-30 10:49:07,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-30 10:49:07,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-30 10:49:07,211 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:49:07,211 INFO L87 Difference]: Start difference. First operand 2806 states and 2906 transitions. Second operand 53 states. [2018-09-30 10:49:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:49:07,902 INFO L93 Difference]: Finished difference Result 2806 states and 2906 transitions. [2018-09-30 10:49:07,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 10:49:07,902 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 208 [2018-09-30 10:49:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:49:07,903 INFO L225 Difference]: With dead ends: 2806 [2018-09-30 10:49:07,903 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:49:07,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:49:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:49:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:49:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:49:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:49:07,906 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 208 [2018-09-30 10:49:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:49:07,906 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:49:07,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-30 10:49:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:49:07,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:49:07,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:49:08,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:49:14,497 WARN L178 SmtUtils]: Spent 6.56 s on a formula simplification. DAG size of input: 1731 DAG size of output: 1115 [2018-09-30 10:49:17,300 WARN L178 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 1588 DAG size of output: 1118 [2018-09-30 10:49:29,785 WARN L178 SmtUtils]: Spent 12.46 s on a formula simplification. DAG size of input: 1115 DAG size of output: 511 [2018-09-30 10:49:39,242 WARN L178 SmtUtils]: Spent 9.44 s on a formula simplification. DAG size of input: 1115 DAG size of output: 509 [2018-09-30 10:49:39,247 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 55) no Hoare annotation was computed. [2018-09-30 10:49:39,247 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 55) no Hoare annotation was computed. [2018-09-30 10:49:39,247 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 55) no Hoare annotation was computed. [2018-09-30 10:49:39,248 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-30 10:49:39,248 INFO L422 ceAbstractionStarter]: At program point L46(lines 46 53) the Hoare annotation is: false [2018-09-30 10:49:39,249 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 54) no Hoare annotation was computed. [2018-09-30 10:49:39,250 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-30 10:49:39,301 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:49:39 BoogieIcfgContainer [2018-09-30 10:49:39,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:49:39,302 INFO L168 Benchmark]: Toolchain (without parser) took 158837.46 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 854.1 MB). Free memory was 1.4 GB in the beginning and 965.7 MB in the end (delta: 460.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-09-30 10:49:39,303 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-30 10:49:39,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.86 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-30 10:49:39,304 INFO L168 Benchmark]: Boogie Preprocessor took 19.57 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-30 10:49:39,305 INFO L168 Benchmark]: RCFGBuilder took 256.38 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-30 10:49:39,306 INFO L168 Benchmark]: TraceAbstraction took 158515.58 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 854.1 MB). Free memory was 1.4 GB in the beginning and 965.7 MB in the end (delta: 439.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-09-30 10:49:39,310 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 38.86 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 19.57 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 256.38 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 158515.58 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 854.1 MB). Free memory was 1.4 GB in the beginning and 965.7 MB in the end (delta: 439.5 MB). Peak memory consumption was 1.5 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, 158.3s OverallTime, 39 OverallIterations, 102 TraceHistogramMax, 79.4s AutomataDifference, 0.0s DeadEndRemovalTime, 31.3s 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: 15.0s AutomataMinimizationTime, 39 MinimizatonAttempts, 1976 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 205 NumberOfFragments, 2628 HoareAnnotationTreeSize, 3 FomulaSimplifications, 520258123268 FormulaSimplificationTreeSizeReduction, 9.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1637333720 FormulaSimplificationTreeSizeReductionInter, 21.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 26.6s 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-30_10-49-39-336.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-30_10-49-39-336.csv Received shutdown request...