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/nested.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:44:59,258 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:44:59,261 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:44:59,279 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:44:59,280 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:44:59,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:44:59,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:44:59,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:44:59,289 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:44:59,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:44:59,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:44:59,298 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:44:59,302 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:44:59,303 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:44:59,308 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:44:59,309 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:44:59,310 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:44:59,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:44:59,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:44:59,321 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:44:59,323 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:44:59,324 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:44:59,327 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:44:59,328 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:44:59,328 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:44:59,329 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:44:59,330 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:44:59,333 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:44:59,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:44:59,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:44:59,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:44:59,339 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:44:59,339 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:44:59,340 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:44:59,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:44:59,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:44:59,344 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-26 21:44:59,372 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:44:59,373 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:44:59,374 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:44:59,374 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:44:59,375 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:44:59,375 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:44:59,375 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:44:59,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:44:59,376 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:44:59,377 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:44:59,377 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:44:59,377 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:44:59,377 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:44:59,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:44:59,378 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:44:59,378 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:44:59,378 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:44:59,378 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:44:59,379 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:44:59,380 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:44:59,380 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:44:59,380 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:44:59,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:44:59,381 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:44:59,381 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:44:59,381 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:44:59,381 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:44:59,381 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:44:59,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:44:59,382 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:44:59,382 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:44:59,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:44:59,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:44:59,450 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:44:59,452 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:44:59,453 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:44:59,453 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-09-26 21:44:59,454 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-09-26 21:44:59,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:44:59,519 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:44:59,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:44:59,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:44:59,520 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:44:59,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:59" (1/1) ... [2018-09-26 21:44:59,554 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:59" (1/1) ... [2018-09-26 21:44:59,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:44:59,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:44:59,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:44:59,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:44:59,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:59" (1/1) ... [2018-09-26 21:44:59,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:59" (1/1) ... [2018-09-26 21:44:59,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:59" (1/1) ... [2018-09-26 21:44:59,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:59" (1/1) ... [2018-09-26 21:44:59,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:59" (1/1) ... [2018-09-26 21:44:59,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:59" (1/1) ... [2018-09-26 21:44:59,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:59" (1/1) ... [2018-09-26 21:44:59,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:44:59,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:44:59,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:44:59,588 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:44:59,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:44:59,660 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-26 21:44:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:44:59,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:44:59,890 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:44:59,891 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:44:59 BoogieIcfgContainer [2018-09-26 21:44:59,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:44:59,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:44:59,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:44:59,896 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:44:59,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:44:59" (1/2) ... [2018-09-26 21:44:59,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307e71b0 and model type nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:44:59, skipping insertion in model container [2018-09-26 21:44:59,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:44:59" (2/2) ... [2018-09-26 21:44:59,899 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-09-26 21:44:59,910 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:44:59,918 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:44:59,970 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:44:59,971 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:44:59,972 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:44:59,972 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:44:59,972 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:44:59,972 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:44:59,972 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:44:59,972 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:44:59,973 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:44:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-26 21:44:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 21:44:59,995 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:59,997 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 21:44:59,998 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:00,007 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-09-26 21:45:00,010 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:00,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:00,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:00,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:00,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:45:00,159 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:45:00,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:45:00,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:45:00,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:45:00,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:00,182 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-26 21:45:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:00,389 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-09-26 21:45:00,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:45:00,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 21:45:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:00,401 INFO L225 Difference]: With dead ends: 11 [2018-09-26 21:45:00,401 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 21:45:00,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 21:45:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-09-26 21:45:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 21:45:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-09-26 21:45:00,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-09-26 21:45:00,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:00,441 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-09-26 21:45:00,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:45:00,441 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-09-26 21:45:00,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:45:00,441 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:00,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:45:00,442 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:00,442 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:00,443 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-09-26 21:45:00,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:00,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:00,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:00,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:00,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:45:00,522 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:45:00,522 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:45:00,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:45:00,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:45:00,524 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:00,524 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-09-26 21:45:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:00,628 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-09-26 21:45:00,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:45:00,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-09-26 21:45:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:00,629 INFO L225 Difference]: With dead ends: 11 [2018-09-26 21:45:00,629 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 21:45:00,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:00,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 21:45:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 21:45:00,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 21:45:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-09-26 21:45:00,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-09-26 21:45:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:00,633 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-09-26 21:45:00,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:45:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-09-26 21:45:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 21:45:00,634 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:00,634 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 21:45:00,635 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:00,635 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:00,635 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-09-26 21:45:00,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:00,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:00,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:00,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:00,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:45:00,759 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:00,759 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:00,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:00,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:45:00,979 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:00,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-26 21:45:00,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:45:00,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:45:00,980 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:00,980 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2018-09-26 21:45:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:01,259 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-09-26 21:45:01,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:45:01,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 21:45:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:01,260 INFO L225 Difference]: With dead ends: 13 [2018-09-26 21:45:01,261 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 21:45:01,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 21:45:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 21:45:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 21:45:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-09-26 21:45:01,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-09-26 21:45:01,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:01,265 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-09-26 21:45:01,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:45:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-09-26 21:45:01,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:45:01,266 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:01,266 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-09-26 21:45:01,267 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:01,267 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:01,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-09-26 21:45:01,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:01,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:01,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:01,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:01,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:45:01,404 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:01,404 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:01,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:45:01,444 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:45:01,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:01,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 21:45:01,545 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:01,546 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-09-26 21:45:01,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:45:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:45:01,547 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:01,547 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 8 states. [2018-09-26 21:45:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:03,107 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2018-09-26 21:45:03,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:45:03,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 21:45:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:03,109 INFO L225 Difference]: With dead ends: 24 [2018-09-26 21:45:03,109 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 21:45:03,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 21:45:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-09-26 21:45:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 21:45:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-09-26 21:45:03,116 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2018-09-26 21:45:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:03,116 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-09-26 21:45:03,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:45:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-09-26 21:45:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:45:03,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:03,117 INFO L375 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-09-26 21:45:03,118 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:03,118 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:03,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 3 times [2018-09-26 21:45:03,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:03,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:03,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:03,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:03,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-26 21:45:03,233 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:03,233 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:03,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:45:03,282 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-26 21:45:03,282 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:03,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-26 21:45:03,422 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:03,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-09-26 21:45:03,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:45:03,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:45:03,423 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:03,423 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 11 states. [2018-09-26 21:45:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:03,487 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-09-26 21:45:03,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:45:03,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-09-26 21:45:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:03,489 INFO L225 Difference]: With dead ends: 24 [2018-09-26 21:45:03,489 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 21:45:03,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:03,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 21:45:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 21:45:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 21:45:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-09-26 21:45:03,495 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-09-26 21:45:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:03,495 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-09-26 21:45:03,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:45:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-09-26 21:45:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:45:03,496 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:03,496 INFO L375 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-09-26 21:45:03,497 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:03,497 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:03,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 4 times [2018-09-26 21:45:03,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:03,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:03,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:03,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:03,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-26 21:45:03,585 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:03,585 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:03,593 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:45:03,640 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:45:03,641 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:03,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-26 21:45:03,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:03,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-26 21:45:03,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:45:03,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:45:03,953 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:03,953 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 13 states. [2018-09-26 21:45:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:04,172 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-09-26 21:45:04,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:45:04,175 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-09-26 21:45:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:04,176 INFO L225 Difference]: With dead ends: 27 [2018-09-26 21:45:04,176 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 21:45:04,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 21:45:04,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 21:45:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 21:45:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-09-26 21:45:04,185 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-09-26 21:45:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:04,185 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-09-26 21:45:04,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:45:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-09-26 21:45:04,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 21:45:04,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:04,187 INFO L375 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2018-09-26 21:45:04,188 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:04,188 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:04,188 INFO L82 PathProgramCache]: Analyzing trace with hash 650597027, now seen corresponding path program 5 times [2018-09-26 21:45:04,188 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:04,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:04,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:04,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:04,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-26 21:45:04,351 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:04,351 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:04,359 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:45:04,435 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-09-26 21:45:04,436 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:04,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-26 21:45:04,545 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:04,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-09-26 21:45:04,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:45:04,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:45:04,546 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:04,546 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 15 states. [2018-09-26 21:45:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:04,710 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-09-26 21:45:04,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:45:04,711 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-09-26 21:45:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:04,712 INFO L225 Difference]: With dead ends: 30 [2018-09-26 21:45:04,712 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 21:45:04,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 21:45:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 21:45:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 21:45:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-09-26 21:45:04,718 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-09-26 21:45:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:04,718 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-09-26 21:45:04,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:45:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-09-26 21:45:04,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 21:45:04,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:04,719 INFO L375 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2018-09-26 21:45:04,720 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:04,720 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:04,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1318725353, now seen corresponding path program 6 times [2018-09-26 21:45:04,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:04,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:04,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:04,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:04,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-26 21:45:04,836 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:04,836 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:04,845 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:45:04,857 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-09-26 21:45:04,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:04,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-26 21:45:04,986 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:04,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-09-26 21:45:04,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:45:04,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:45:04,988 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:04,988 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 13 states. [2018-09-26 21:45:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:06,538 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-09-26 21:45:06,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 21:45:06,538 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-09-26 21:45:06,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:06,539 INFO L225 Difference]: With dead ends: 50 [2018-09-26 21:45:06,539 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 21:45:06,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 21:45:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-09-26 21:45:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 21:45:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-09-26 21:45:06,548 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 19 [2018-09-26 21:45:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:06,549 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-09-26 21:45:06,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:45:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-09-26 21:45:06,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:45:06,550 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:06,550 INFO L375 BasicCegarLoop]: trace histogram [21, 3, 3, 1, 1, 1] [2018-09-26 21:45:06,551 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:06,552 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1893667570, now seen corresponding path program 7 times [2018-09-26 21:45:06,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:06,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:06,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:06,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:06,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 131 proven. 28 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-09-26 21:45:06,761 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:06,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:06,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:06,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 131 proven. 28 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-09-26 21:45:08,074 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:08,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-09-26 21:45:08,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 21:45:08,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 21:45:08,077 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:08,077 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 19 states. [2018-09-26 21:45:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:08,477 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-09-26 21:45:08,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:45:08,480 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-09-26 21:45:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:08,480 INFO L225 Difference]: With dead ends: 55 [2018-09-26 21:45:08,481 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 21:45:08,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 21:45:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 21:45:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 21:45:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-09-26 21:45:08,490 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 30 [2018-09-26 21:45:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:08,490 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-09-26 21:45:08,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 21:45:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-09-26 21:45:08,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 21:45:08,491 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:08,491 INFO L375 BasicCegarLoop]: trace histogram [24, 3, 3, 1, 1, 1] [2018-09-26 21:45:08,492 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:08,492 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:08,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1170740991, now seen corresponding path program 8 times [2018-09-26 21:45:08,492 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:08,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:08,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:08,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:08,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-09-26 21:45:08,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:08,645 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:08,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:45:08,710 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:45:08,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:08,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-09-26 21:45:08,991 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:08,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-09-26 21:45:08,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 21:45:08,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 21:45:08,992 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:08,992 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 21 states. [2018-09-26 21:45:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:09,212 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-09-26 21:45:09,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:45:09,216 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-09-26 21:45:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:09,217 INFO L225 Difference]: With dead ends: 60 [2018-09-26 21:45:09,217 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 21:45:09,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 21:45:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 21:45:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 21:45:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-09-26 21:45:09,229 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 33 [2018-09-26 21:45:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:09,230 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-09-26 21:45:09,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 21:45:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-09-26 21:45:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 21:45:09,234 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:09,234 INFO L375 BasicCegarLoop]: trace histogram [27, 3, 3, 1, 1, 1] [2018-09-26 21:45:09,234 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:09,234 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:09,235 INFO L82 PathProgramCache]: Analyzing trace with hash 251197998, now seen corresponding path program 9 times [2018-09-26 21:45:09,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:09,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:09,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:09,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:09,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 203 proven. 45 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-09-26 21:45:09,485 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:09,486 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:09,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:45:09,676 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-09-26 21:45:09,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:09,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 203 proven. 45 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-09-26 21:45:09,995 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:09,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-09-26 21:45:09,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 21:45:09,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 21:45:09,996 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:09,997 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 23 states. [2018-09-26 21:45:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:10,283 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-09-26 21:45:10,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:45:10,288 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-09-26 21:45:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:10,288 INFO L225 Difference]: With dead ends: 65 [2018-09-26 21:45:10,289 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 21:45:10,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 21:45:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 21:45:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 21:45:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-09-26 21:45:10,298 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2018-09-26 21:45:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:10,299 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-09-26 21:45:10,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 21:45:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-09-26 21:45:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 21:45:10,300 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:10,300 INFO L375 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2018-09-26 21:45:10,300 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:10,300 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:10,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1180066335, now seen corresponding path program 10 times [2018-09-26 21:45:10,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:10,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:10,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:10,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:10,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-09-26 21:45:10,570 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:10,572 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:10,582 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:45:10,629 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:45:10,629 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:10,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-09-26 21:45:10,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:10,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-26 21:45:10,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:45:10,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:45:10,792 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:10,792 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2018-09-26 21:45:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:11,107 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-09-26 21:45:11,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:45:11,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-09-26 21:45:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:11,109 INFO L225 Difference]: With dead ends: 65 [2018-09-26 21:45:11,109 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 21:45:11,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 21:45:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-09-26 21:45:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 21:45:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-09-26 21:45:11,124 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-09-26 21:45:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:11,124 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-09-26 21:45:11,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:45:11,125 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-09-26 21:45:11,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 21:45:11,126 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:11,126 INFO L375 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2018-09-26 21:45:11,126 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:11,126 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:11,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1381898283, now seen corresponding path program 11 times [2018-09-26 21:45:11,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:11,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:11,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:11,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:11,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-09-26 21:45:11,269 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:11,269 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:11,277 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:45:11,339 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-09-26 21:45:11,339 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:11,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-09-26 21:45:12,014 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:12,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-09-26 21:45:12,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:45:12,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:45:12,015 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:12,015 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 12 states. [2018-09-26 21:45:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:12,151 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-09-26 21:45:12,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:45:12,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-09-26 21:45:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:12,152 INFO L225 Difference]: With dead ends: 77 [2018-09-26 21:45:12,152 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 21:45:12,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:12,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 21:45:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2018-09-26 21:45:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 21:45:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-09-26 21:45:12,168 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2018-09-26 21:45:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:12,169 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-09-26 21:45:12,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:45:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-09-26 21:45:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 21:45:12,170 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:12,170 INFO L375 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2018-09-26 21:45:12,170 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:12,170 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash -536120459, now seen corresponding path program 12 times [2018-09-26 21:45:12,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:12,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:12,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:12,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-09-26 21:45:12,567 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:12,567 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:12,574 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:45:12,631 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-09-26 21:45:12,631 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:12,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-09-26 21:45:12,855 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:12,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-26 21:45:12,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:45:12,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:45:12,856 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:12,857 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 14 states. [2018-09-26 21:45:13,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:13,051 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-09-26 21:45:13,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:45:13,052 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-09-26 21:45:13,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:13,053 INFO L225 Difference]: With dead ends: 89 [2018-09-26 21:45:13,053 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 21:45:13,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:13,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 21:45:13,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-09-26 21:45:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 21:45:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-09-26 21:45:13,072 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2018-09-26 21:45:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:13,072 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-09-26 21:45:13,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:45:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-09-26 21:45:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 21:45:13,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:13,074 INFO L375 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2018-09-26 21:45:13,074 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:13,074 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:13,074 INFO L82 PathProgramCache]: Analyzing trace with hash -681037889, now seen corresponding path program 13 times [2018-09-26 21:45:13,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:13,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:13,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:13,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:13,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-09-26 21:45:13,566 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:13,566 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:13,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:13,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-09-26 21:45:13,873 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:13,873 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-26 21:45:13,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:45:13,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:45:13,874 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:13,874 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 16 states. [2018-09-26 21:45:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:14,013 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-09-26 21:45:14,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:45:14,014 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-09-26 21:45:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:14,015 INFO L225 Difference]: With dead ends: 101 [2018-09-26 21:45:14,016 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 21:45:14,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:14,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 21:45:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-09-26 21:45:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 21:45:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-09-26 21:45:14,037 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2018-09-26 21:45:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:14,037 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-09-26 21:45:14,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:45:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-09-26 21:45:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 21:45:14,039 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:14,039 INFO L375 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-09-26 21:45:14,039 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:14,039 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:14,039 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 14 times [2018-09-26 21:45:14,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:14,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:14,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:14,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:45:14,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-09-26 21:45:14,235 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:14,235 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:14,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:45:14,307 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:45:14,307 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:14,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-09-26 21:45:14,855 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:14,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-09-26 21:45:14,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:45:14,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:45:14,856 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:14,856 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 18 states. [2018-09-26 21:45:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:15,059 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-09-26 21:45:15,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:45:15,061 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-09-26 21:45:15,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:15,062 INFO L225 Difference]: With dead ends: 113 [2018-09-26 21:45:15,062 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 21:45:15,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 21:45:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-09-26 21:45:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 21:45:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-09-26 21:45:15,090 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-09-26 21:45:15,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:15,091 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-09-26 21:45:15,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:45:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-09-26 21:45:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 21:45:15,093 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:15,093 INFO L375 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-09-26 21:45:15,093 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:15,093 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:15,094 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 15 times [2018-09-26 21:45:15,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:15,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:15,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:15,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:15,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-09-26 21:45:15,893 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:15,893 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:15,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:45:16,015 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-09-26 21:45:16,016 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:16,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-09-26 21:45:16,327 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:16,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-26 21:45:16,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:45:16,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:45:16,328 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:16,328 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 20 states. [2018-09-26 21:45:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:16,496 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-09-26 21:45:16,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:45:16,496 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-09-26 21:45:16,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:16,497 INFO L225 Difference]: With dead ends: 125 [2018-09-26 21:45:16,497 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 21:45:16,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:16,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 21:45:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-09-26 21:45:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 21:45:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-09-26 21:45:16,522 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-09-26 21:45:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:16,523 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-09-26 21:45:16,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:45:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-09-26 21:45:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 21:45:16,524 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:16,525 INFO L375 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-09-26 21:45:16,525 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:16,525 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:16,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 16 times [2018-09-26 21:45:16,525 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:16,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:16,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:16,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:16,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-09-26 21:45:16,726 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:16,726 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:45:16,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:45:16,836 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:45:16,837 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:16,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-09-26 21:45:17,342 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:17,342 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-09-26 21:45:17,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 21:45:17,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 21:45:17,343 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:17,343 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 22 states. [2018-09-26 21:45:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:17,585 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-09-26 21:45:17,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:45:17,586 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-09-26 21:45:17,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:17,587 INFO L225 Difference]: With dead ends: 137 [2018-09-26 21:45:17,587 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 21:45:17,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 21:45:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-09-26 21:45:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 21:45:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-09-26 21:45:17,621 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-09-26 21:45:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:17,622 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-09-26 21:45:17,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 21:45:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-09-26 21:45:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 21:45:17,623 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:17,624 INFO L375 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-09-26 21:45:17,624 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:17,624 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 17 times [2018-09-26 21:45:17,625 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:17,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:17,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:17,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-26 21:45:21,146 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:45:21,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-09-26 21:45:21,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 21:45:21,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 21:45:21,149 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:21,149 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2018-09-26 21:45:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:25,403 INFO L93 Difference]: Finished difference Result 5119 states and 5579 transitions. [2018-09-26 21:45:25,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 21:45:25,403 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2018-09-26 21:45:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:25,404 INFO L225 Difference]: With dead ends: 5119 [2018-09-26 21:45:25,404 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:45:25,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:25,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:45:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:45:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:45:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:45:25,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2018-09-26 21:45:25,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:25,414 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:45:25,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 21:45:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:45:25,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:45:25,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:45:31,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:31,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:32,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:33,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:34,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:34,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:34,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:34,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:34,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:34,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:34,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:34,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:34,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:34,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:34,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:35,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:35,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:35,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:35,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:35,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:35,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:35,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:35,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:35,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:35,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:35,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:35,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:36,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:36,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:36,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:36,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:36,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:36,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:36,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:36,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:36,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:37,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:37,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:37,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:37,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:37,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:37,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:37,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:37,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:38,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:38,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:38,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:38,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:38,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:39,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:39,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:39,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:39,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:39,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:40,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:40,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:40,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:40,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:40,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:40,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:41,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:41,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:41,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:41,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:42,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:42,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:42,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:42,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:42,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:42,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:42,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:43,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:43,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:43,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:43,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:44,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:44,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:44,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:44,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:44,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:44,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:45,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:45,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:45,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:46,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:46,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:46,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:46,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:46,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:47,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:47,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:47,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:48,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:48,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:48,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:48,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:48,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:48,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:48,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:49,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:49,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:49,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:50,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:50,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:50,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:51,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:51,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:51,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:52,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:53,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:53,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:53,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:54,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:54,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:55,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:55,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:57,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:57,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:58,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:58,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:59,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:45:59,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:00,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:01,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:01,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:01,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:01,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:01,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:02,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:02,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:02,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:03,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:04,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:04,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:05,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:06,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:06,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:07,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:07,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:07,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:07,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:08,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:09,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:09,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:11,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:12,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:12,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:13,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:13,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:14,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:15,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:16,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:16,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:22,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:23,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:25,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:25,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:26,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:28,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:32,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:32,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:35,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:37,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:38,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:40,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:46:55,461 WARN L178 SmtUtils]: Spent 1.50 m on a formula simplification. DAG size of input: 5112 DAG size of output: 2150 [2018-09-26 21:46:56,305 WARN L178 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-09-26 21:48:27,022 WARN L178 SmtUtils]: Spent 1.51 m on a formula simplification. DAG size of input: 2150 DAG size of output: 362 [2018-09-26 21:48:33,256 WARN L178 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-09-26 21:48:33,262 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-09-26 21:48:33,263 INFO L422 ceAbstractionStarter]: At program point L64(lines 49 65) the Hoare annotation is: (let ((.cse24 (<= ULTIMATE.start_main_~j~5 7)) (.cse13 (<= ULTIMATE.start_main_~j~5 1)) (.cse11 (<= ULTIMATE.start_main_~j~5 9)) (.cse27 (<= ULTIMATE.start_main_~j~5 2)) (.cse39 (<= ULTIMATE.start_main_~j~5 0)) (.cse19 (<= ULTIMATE.start_main_~j~5 5)) (.cse21 (<= ULTIMATE.start_main_~j~5 3)) (.cse35 (<= ULTIMATE.start_main_~j~5 8)) (.cse31 (<= ULTIMATE.start_main_~j~5 4)) (.cse32 (<= ULTIMATE.start_main_~j~5 6)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5))) (let ((.cse6 (<= 70 ULTIMATE.start_main_~k~5)) (.cse26 (<= 90 ULTIMATE.start_main_~k~5)) (.cse3 (<= 20 ULTIMATE.start_main_~k~5)) (.cse36 (<= 30 ULTIMATE.start_main_~k~5)) (.cse8 (<= 40 ULTIMATE.start_main_~k~5)) (.cse37 (<= 50 ULTIMATE.start_main_~k~5)) (.cse30 (<= ULTIMATE.start_main_~i~5 2)) (.cse34 (<= 60 ULTIMATE.start_main_~k~5)) (.cse20 (and .cse32 .cse4)) (.cse33 (and .cse31 .cse4)) (.cse1 (<= ULTIMATE.start_main_~i~5 5)) (.cse28 (and .cse35 .cse4)) (.cse12 (and .cse21 .cse4)) (.cse23 (and .cse19 .cse4)) (.cse10 (and .cse4 .cse39)) (.cse18 (<= 80 ULTIMATE.start_main_~k~5)) (.cse7 (<= ULTIMATE.start_main_~i~5 6)) (.cse5 (<= ULTIMATE.start_main_~i~5 1)) (.cse22 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse29 (and .cse4 .cse27)) (.cse40 (<= 10 ULTIMATE.start_main_~k~5)) (.cse14 (<= ULTIMATE.start_main_~i~5 0)) (.cse25 (<= ULTIMATE.start_main_~i~5 8)) (.cse38 (and .cse4 .cse11)) (.cse9 (<= ULTIMATE.start_main_~i~5 4)) (.cse17 (<= ULTIMATE.start_main_~i~5 3)) (.cse15 (and .cse13 .cse4)) (.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse2 (and .cse24 .cse4)) (.cse16 (<= ULTIMATE.start_main_~i~5 7))) (or (and .cse0 .cse1 (<= 57 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse4 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10) (and .cse0 (<= 19 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse11) (and .cse0 .cse12 .cse7 (<= 63 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 1 ULTIMATE.start_main_~k~5) .cse13 .cse4 .cse14) (and .cse0 (<= 71 ULTIMATE.start_main_~k~5) .cse15 .cse16) (and .cse0 .cse17 .cse4 .cse11 (<= 39 ULTIMATE.start_main_~k~5)) (and .cse0 .cse4 .cse18 .cse16) (and .cse0 .cse19 .cse17 .cse4 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 46 ULTIMATE.start_main_~k~5) .cse20 .cse9) (and .cse0 .cse21 .cse17 .cse4 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 76 ULTIMATE.start_main_~k~5) .cse20 .cse16) (and (and .cse22 .cse23) (<= 95 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 7 ULTIMATE.start_main_~k~5) .cse24 .cse4 .cse14) (and .cse0 .cse25 .cse26 .cse4) (and .cse0 (<= 32 ULTIMATE.start_main_~k~5) .cse17 .cse4 .cse27) (and .cse0 (<= 78 ULTIMATE.start_main_~k~5) .cse28 .cse16) (and .cse0 .cse25 (<= 82 ULTIMATE.start_main_~k~5) .cse29) (and .cse0 .cse30 .cse21 (<= 23 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse4 .cse11 (<= 9 ULTIMATE.start_main_~k~5) .cse14) (and .cse0 .cse31 .cse4 (<= 4 ULTIMATE.start_main_~k~5) .cse14) (and .cse0 (<= 3 ULTIMATE.start_main_~k~5) .cse21 .cse4 .cse14) (and .cse0 .cse32 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse14) (and .cse0 .cse24 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse5) (and .cse0 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse27 .cse14) (and .cse0 .cse30 .cse4 (<= 22 ULTIMATE.start_main_~k~5) .cse27) (and (<= 74 ULTIMATE.start_main_~k~5) .cse0 .cse33 .cse16) (and .cse0 .cse34 .cse10 .cse7) (and .cse0 .cse1 (<= 51 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 (<= 42 ULTIMATE.start_main_~k~5) .cse29 .cse9) (and .cse0 .cse6 .cse10 .cse16) (and (<= 98 ULTIMATE.start_main_~k~5) (and .cse22 .cse28)) (and .cse0 .cse25 (<= 87 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 (<= 29 ULTIMATE.start_main_~k~5) .cse30 .cse4 .cse11) (and .cse0 .cse30 (<= 25 ULTIMATE.start_main_~k~5) .cse19 .cse4) (and .cse0 (<= 56 ULTIMATE.start_main_~k~5) .cse1 .cse20) (and .cse0 (<= 12 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse27) (and .cse0 (<= 53 ULTIMATE.start_main_~k~5) .cse1 .cse12) (and .cse0 (<= 45 ULTIMATE.start_main_~k~5) .cse19 .cse4 .cse9) (and .cse0 (<= 61 ULTIMATE.start_main_~k~5) .cse15 .cse7) (and (<= 93 ULTIMATE.start_main_~k~5) (and .cse22 .cse12)) (and .cse0 .cse1 (<= 55 ULTIMATE.start_main_~k~5) .cse23) (and .cse0 .cse21 (<= 13 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse25 (<= 83 ULTIMATE.start_main_~k~5) .cse12) (and .cse0 .cse32 .cse30 (<= 26 ULTIMATE.start_main_~k~5) .cse4) (and .cse26 (and .cse22 .cse10)) (and .cse0 .cse25 (<= 88 ULTIMATE.start_main_~k~5) .cse28) (and (<= 100 ULTIMATE.start_main_~k~5) (and .cse22 .cse4)) (and .cse0 .cse1 .cse29 (<= 52 ULTIMATE.start_main_~k~5)) (and .cse0 .cse35 (<= 48 ULTIMATE.start_main_~k~5) .cse4 .cse9) (and .cse0 .cse30 .cse4 .cse36) (and .cse0 .cse25 (<= 86 ULTIMATE.start_main_~k~5) .cse20) (and .cse0 .cse33 .cse9 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 18 ULTIMATE.start_main_~k~5) .cse35 .cse4 .cse5) (and .cse0 .cse37 .cse9 .cse4) (and .cse0 .cse31 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse28 .cse7 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 (<= 21 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse0 (<= 11 ULTIMATE.start_main_~k~5) .cse13 .cse4 .cse5) (and .cse0 .cse38 (<= 69 ULTIMATE.start_main_~k~5) .cse7) (and .cse0 .cse25 (<= 85 ULTIMATE.start_main_~k~5) .cse23) (and .cse0 (<= 54 ULTIMATE.start_main_~k~5) .cse1 .cse33) (and .cse0 .cse19 .cse4 (<= 5 ULTIMATE.start_main_~k~5) .cse14) (and .cse0 .cse38 .cse1 (<= 59 ULTIMATE.start_main_~k~5)) (and .cse0 .cse3 .cse30 .cse4 .cse39) (and (and .cse22 .cse38) (<= 99 ULTIMATE.start_main_~k~5)) (and .cse0 .cse23 (<= 65 ULTIMATE.start_main_~k~5) .cse7) (and .cse0 .cse17 .cse4 .cse39 .cse36) (and .cse0 .cse30 .cse31 (<= 24 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse35 .cse4 (<= 8 ULTIMATE.start_main_~k~5) .cse14) (and .cse0 .cse32 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and (and .cse22 .cse2) (<= 97 ULTIMATE.start_main_~k~5)) (and .cse0 .cse8 .cse17 .cse4) (and (and .cse22 .cse15) (<= 91 ULTIMATE.start_main_~k~5)) (and .cse0 .cse15 (<= 41 ULTIMATE.start_main_~k~5) .cse9) (and .cse0 .cse33 (<= 64 ULTIMATE.start_main_~k~5) .cse7) (and .cse0 .cse2 .cse7 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 (<= 15 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse30 (<= 27 ULTIMATE.start_main_~k~5) .cse24 .cse4) (and .cse0 .cse37 .cse1 .cse10) (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse4 .cse39 .cse14) (and .cse0 .cse30 .cse35 (<= 28 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse17 .cse24 .cse4 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse0 .cse20 (<= 66 ULTIMATE.start_main_~k~5) .cse7) (and .cse0 .cse38 (<= 79 ULTIMATE.start_main_~k~5) .cse16) (and (and .cse22 .cse33) (<= 94 ULTIMATE.start_main_~k~5)) (and .cse0 .cse4 .cse1 .cse34) (and (and .cse22 .cse20) (<= 96 ULTIMATE.start_main_~k~5)) (and .cse0 .cse35 (<= 38 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse0 .cse25 (<= 84 ULTIMATE.start_main_~k~5) .cse33) (and .cse0 .cse1 .cse28 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse0 .cse24 .cse4 (<= 47 ULTIMATE.start_main_~k~5) .cse9) (and .cse0 (<= 73 ULTIMATE.start_main_~k~5) .cse12 .cse16) (and .cse0 .cse23 .cse16 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse0 .cse21 (<= 43 ULTIMATE.start_main_~k~5) .cse4 .cse9) (and .cse0 .cse31 (<= 34 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse0 .cse32 .cse17 (<= 36 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 (<= 72 ULTIMATE.start_main_~k~5) .cse29 .cse16) (and .cse0 .cse25 .cse10 .cse18) (and .cse0 .cse29 .cse7 (<= 62 ULTIMATE.start_main_~k~5)) (and .cse0 .cse40 .cse4 .cse39 .cse5) (and (and .cse22 .cse29) (<= 92 ULTIMATE.start_main_~k~5)) (and .cse0 .cse25 (<= 89 ULTIMATE.start_main_~k~5) .cse38) (and .cse0 .cse40 .cse4 .cse14) (and .cse0 .cse25 (<= 81 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 .cse38 .cse9 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse0 .cse17 .cse15 (<= 31 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 77 ULTIMATE.start_main_~k~5) .cse2 .cse16)))) [2018-09-26 21:48:33,264 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2018-09-26 21:48:33,264 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-09-26 21:48:33,264 INFO L422 ceAbstractionStarter]: At program point L45(lines 45 50) the Hoare annotation is: false [2018-09-26 21:48:33,264 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2018-09-26 21:48:33,264 INFO L422 ceAbstractionStarter]: At program point L70(lines 33 70) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse1 (<= 10 ULTIMATE.start_main_~m~5))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 0)) (and .cse0 (<= 60 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 6)) (and .cse0 (<= 50 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 5) .cse1) (and (<= 100 ULTIMATE.start_main_~k~5) .cse1) (and .cse0 (<= 20 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 2) .cse1) (and .cse0 (<= 90 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 9) .cse1) (and .cse0 (<= ULTIMATE.start_main_~i~5 8) .cse1 (<= 80 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 40 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 4) .cse1) (and .cse0 (<= 70 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 7)) (and .cse0 (<= ULTIMATE.start_main_~i~5 3) .cse1 (<= 30 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 10 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 1)))) [2018-09-26 21:48:33,300 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:48:33 BoogieIcfgContainer [2018-09-26 21:48:33,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:48:33,301 INFO L168 Benchmark]: Toolchain (without parser) took 213785.08 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 341.2 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-09-26 21:48:33,303 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:48:33,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:48:33,304 INFO L168 Benchmark]: Boogie Preprocessor took 23.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:48:33,304 INFO L168 Benchmark]: RCFGBuilder took 303.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:48:33,305 INFO L168 Benchmark]: TraceAbstraction took 213408.33 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 320.0 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-09-26 21:48:33,309 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 303.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 213408.33 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 320.0 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: 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: 49]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((10 <= main_~n~5 && main_~i~5 <= 5) && 57 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) || (((10 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 70 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5 && main_~j~5 <= 0)) || ((((10 <= main_~n~5 && 19 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 9)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && main_~i~5 <= 6) && 63 <= main_~k~5)) || ((((10 <= main_~n~5 && 1 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 71 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 9) && 39 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 80 <= main_~k~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && main_~i~5 <= 3) && 10 <= main_~m~5) && 35 <= main_~k~5)) || (((10 <= main_~n~5 && 46 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && main_~i~5 <= 3) && 10 <= main_~m~5) && 33 <= main_~k~5)) || (((10 <= main_~n~5 && 76 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && 95 <= main_~k~5)) || ((((10 <= main_~n~5 && 7 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 90 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 32 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 78 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 82 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 3) && 23 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 <= 9) && 9 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 10 <= main_~m~5) && 4 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 <= 3) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 2) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 22 <= main_~k~5) && main_~j~5 <= 2)) || (((74 <= main_~k~5 && 10 <= main_~n~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 51 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 42 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 7)) || (98 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 87 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 29 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 25 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 56 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 12 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 53 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 45 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 61 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 6)) || (93 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 55 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 13 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 83 <= main_~k~5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 2) && 26 <= main_~k~5) && 10 <= main_~m~5)) || (90 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 88 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5)) || (100 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 2) && 52 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 48 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 86 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 4) && 44 <= main_~k~5)) || ((((10 <= main_~n~5 && 18 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 6) && 68 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 21 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 11 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 69 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 85 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 54 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 10 <= main_~m~5) && 5 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 5) && 59 <= main_~k~5)) || ((((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 99 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && 65 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 0) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 4) && 24 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 10 <= main_~m~5) && 8 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 97 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 91 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 41 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 64 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 6) && 67 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 15 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 27 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 0)) || ((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 8) && 28 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 7) && 10 <= main_~m~5) && 37 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 66 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 79 <= main_~k~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 94 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && main_~i~5 <= 5) && 60 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 96 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 38 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 84 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 8 && 10 <= main_~m~5) && 58 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 47 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 73 <= main_~k~5) && main_~j~5 <= 3 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 7) && 75 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 43 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 34 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 3) && 36 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 72 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 0) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 6) && 62 <= main_~k~5)) || ((((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 1)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && 92 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 89 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 81 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 4) && 49 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 1 && 10 <= main_~m~5) && 31 <= main_~k~5)) || (((10 <= main_~n~5 && 77 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 7) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 90 <= main_~k~5) && main_~i~5 <= 9) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 213.3s OverallTime, 19 OverallIterations, 100 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 187.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 392 SDslu, 554 SDs, 0 SdLazy, 744 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 963 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 90 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 5119 NumberOfFragments, 1927 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3229534 FormulaSimplificationTreeSizeReduction, 90.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 251704 FormulaSimplificationTreeSizeReductionInter, 96.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 1533 NumberOfCodeBlocks, 1502 NumberOfCodeBlocksAsserted, 164 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 571602 SizeOfPredicates, 32 NumberOfNonLiveVariables, 3238 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 35 InterpolantComputations, 3 PerfectInterpolantSequences, 12968/42447 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/nested.i_4.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-48-33-340.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-48-33-340.csv Received shutdown request...