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-00a8621 [2018-09-30 10:47:17,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:47:17,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:47:17,681 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:47:17,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:47:17,683 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:47:17,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:47:17,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:47:17,690 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:47:17,691 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:47:17,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:47:17,699 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:47:17,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:47:17,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:47:17,704 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:47:17,705 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:47:17,706 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:47:17,709 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:47:17,712 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:47:17,716 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:47:17,717 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:47:17,718 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:47:17,720 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:47:17,720 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:47:17,720 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:47:17,721 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:47:17,722 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:47:17,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:47:17,723 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:47:17,724 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:47:17,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:47:17,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:47:17,726 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:47:17,726 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:47:17,727 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:47:17,727 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:47:17,728 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 10:47:17,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:47:17,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:47:17,743 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:47:17,743 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:47:17,744 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:47:17,744 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:47:17,744 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:47:17,744 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:47:17,745 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:47:17,745 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:47:17,745 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:47:17,745 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:47:17,745 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:47:17,746 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:47:17,746 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:47:17,746 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:47:17,746 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:47:17,748 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:47:17,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:47:17,748 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:47:17,748 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:47:17,749 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:47:17,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:47:17,749 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:47:17,749 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:47:17,749 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:47:17,749 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:47:17,750 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:47:17,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:47:17,750 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:47:17,750 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:47:17,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:47:17,832 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:47:17,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:47:17,841 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:47:17,841 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:47:17,842 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-30 10:47:17,842 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-30 10:47:17,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:47:17,891 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:47:17,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:47:17,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:47:17,892 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:47:17,915 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 30.09 10:47:17" (1/1) ... [2018-09-30 10:47:17,928 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 30.09 10:47:17" (1/1) ... [2018-09-30 10:47:17,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:47:17,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:47:17,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:47:17,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:47:17,948 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 30.09 10:47:17" (1/1) ... [2018-09-30 10:47:17,949 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 30.09 10:47:17" (1/1) ... [2018-09-30 10:47:17,951 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 30.09 10:47:17" (1/1) ... [2018-09-30 10:47:17,952 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 30.09 10:47:17" (1/1) ... [2018-09-30 10:47:17,955 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 30.09 10:47:17" (1/1) ... [2018-09-30 10:47:17,957 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 30.09 10:47:17" (1/1) ... [2018-09-30 10:47:17,958 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 30.09 10:47:17" (1/1) ... [2018-09-30 10:47:17,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:47:17,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:47:17,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:47:17,961 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:47:17,962 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 30.09 10:47:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:47:18,019 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-30 10:47:18,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:47:18,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:47:18,292 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:47:18,293 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:47:18 BoogieIcfgContainer [2018-09-30 10:47:18,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:47:18,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:47:18,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:47:18,298 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:47:18,298 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 30.09 10:47:17" (1/2) ... [2018-09-30 10:47:18,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469ed160 and model type nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:47:18, skipping insertion in model container [2018-09-30 10:47:18,300 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 30.09 10:47:18" (2/2) ... [2018-09-30 10:47:18,301 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-09-30 10:47:18,312 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:47:18,322 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:47:18,384 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:47:18,385 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:47:18,386 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:47:18,386 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:47:18,386 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:47:18,386 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:47:18,387 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:47:18,387 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:47:18,387 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:47:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-30 10:47:18,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-30 10:47:18,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:18,420 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-30 10:47:18,421 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:18,433 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:18,433 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-09-30 10:47:18,436 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:18,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:18,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:18,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:18,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:47:18,610 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:47:18,611 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:47:18,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:47:18,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:47:18,629 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:18,631 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-30 10:47:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:18,837 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-09-30 10:47:18,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:47:18,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-30 10:47:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:18,852 INFO L225 Difference]: With dead ends: 11 [2018-09-30 10:47:18,852 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 10:47:18,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 10:47:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-09-30 10:47:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-30 10:47:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-09-30 10:47:18,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-09-30 10:47:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:18,901 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-09-30 10:47:18,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:47:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-09-30 10:47:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:47:18,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:18,902 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:47:18,902 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:18,902 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:18,902 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-09-30 10:47:18,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:18,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:18,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:18,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:18,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:19,001 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-30 10:47:19,001 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:47:19,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:47:19,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:47:19,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:47:19,004 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:19,004 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-09-30 10:47:19,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:19,121 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-09-30 10:47:19,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:47:19,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-09-30 10:47:19,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:19,122 INFO L225 Difference]: With dead ends: 11 [2018-09-30 10:47:19,123 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 10:47:19,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 10:47:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-30 10:47:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-30 10:47:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-09-30 10:47:19,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-09-30 10:47:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:19,129 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-09-30 10:47:19,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:47:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-09-30 10:47:19,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 10:47:19,130 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:19,130 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-30 10:47:19,130 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:19,130 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:19,130 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-09-30 10:47:19,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:19,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:19,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:19,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:19,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:19,191 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-30 10:47:19,191 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:19,191 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:19,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:19,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:19,443 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-30 10:47:19,475 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:19,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-30 10:47:19,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:47:19,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:47:19,476 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:19,477 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2018-09-30 10:47:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:19,943 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-09-30 10:47:19,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:47:19,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-30 10:47:19,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:19,945 INFO L225 Difference]: With dead ends: 13 [2018-09-30 10:47:19,945 INFO L226 Difference]: Without dead ends: 8 [2018-09-30 10:47:19,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-30 10:47:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-30 10:47:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-30 10:47:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-09-30 10:47:19,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-09-30 10:47:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:19,950 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-09-30 10:47:19,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:47:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-09-30 10:47:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:47:19,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:19,951 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-09-30 10:47:19,953 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:19,953 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:19,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-09-30 10:47:19,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:19,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:19,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:20,045 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-30 10:47:20,045 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:20,045 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:20,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:47:20,079 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:47:20,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:20,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:20,163 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-30 10:47:20,183 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:20,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-09-30 10:47:20,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:47:20,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:47:20,185 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:20,185 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 8 states. [2018-09-30 10:47:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:21,341 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2018-09-30 10:47:21,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:47:21,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-30 10:47:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:21,343 INFO L225 Difference]: With dead ends: 24 [2018-09-30 10:47:21,343 INFO L226 Difference]: Without dead ends: 18 [2018-09-30 10:47:21,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:21,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-30 10:47:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-09-30 10:47:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-30 10:47:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-09-30 10:47:21,350 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2018-09-30 10:47:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:21,350 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-09-30 10:47:21,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:47:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-09-30 10:47:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:47:21,351 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:21,352 INFO L375 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-09-30 10:47:21,352 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:21,352 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:21,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 3 times [2018-09-30 10:47:21,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:21,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:21,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:21,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:21,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:21,444 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-30 10:47:21,444 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:21,444 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:21,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:47:21,483 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-30 10:47:21,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:21,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:21,568 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-30 10:47:21,590 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:21,590 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-09-30 10:47:21,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:47:21,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:47:21,591 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:21,591 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 11 states. [2018-09-30 10:47:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:21,684 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-09-30 10:47:21,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:47:21,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-09-30 10:47:21,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:21,686 INFO L225 Difference]: With dead ends: 24 [2018-09-30 10:47:21,686 INFO L226 Difference]: Without dead ends: 16 [2018-09-30 10:47:21,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-30 10:47:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-30 10:47:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-30 10:47:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-09-30 10:47:21,692 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-09-30 10:47:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:21,692 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-09-30 10:47:21,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:47:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-09-30 10:47:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:47:21,693 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:21,694 INFO L375 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-09-30 10:47:21,694 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:21,694 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:21,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 4 times [2018-09-30 10:47:21,694 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:21,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:21,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:21,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:21,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:21,785 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-30 10:47:21,786 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:21,786 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:21,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:47:21,815 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:47:21,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:21,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:22,036 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-30 10:47:22,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:22,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-30 10:47:22,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:47:22,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:47:22,059 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:22,059 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 13 states. [2018-09-30 10:47:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:22,264 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-09-30 10:47:22,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:47:22,267 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-09-30 10:47:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:22,268 INFO L225 Difference]: With dead ends: 27 [2018-09-30 10:47:22,268 INFO L226 Difference]: Without dead ends: 18 [2018-09-30 10:47:22,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-30 10:47:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-30 10:47:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-30 10:47:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-09-30 10:47:22,274 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-09-30 10:47:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:22,274 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-09-30 10:47:22,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:47:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-09-30 10:47:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 10:47:22,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:22,275 INFO L375 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2018-09-30 10:47:22,276 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:22,276 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash 650597027, now seen corresponding path program 5 times [2018-09-30 10:47:22,276 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:22,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:22,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:22,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:22,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:22,413 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-30 10:47:22,414 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:22,414 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:22,422 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:47:22,457 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-09-30 10:47:22,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:22,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:22,529 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-30 10:47:22,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:22,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-09-30 10:47:22,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:47:22,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:47:22,553 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:22,553 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 15 states. [2018-09-30 10:47:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:22,741 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-09-30 10:47:22,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:47:22,744 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-09-30 10:47:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:22,744 INFO L225 Difference]: With dead ends: 30 [2018-09-30 10:47:22,745 INFO L226 Difference]: Without dead ends: 20 [2018-09-30 10:47:22,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-30 10:47:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-30 10:47:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-30 10:47:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-09-30 10:47:22,751 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-09-30 10:47:22,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:22,751 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-09-30 10:47:22,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:47:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-09-30 10:47:22,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 10:47:22,752 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:22,752 INFO L375 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2018-09-30 10:47:22,752 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:22,753 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:22,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1318725353, now seen corresponding path program 6 times [2018-09-30 10:47:22,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:22,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:22,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:22,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:22,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:22,863 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-30 10:47:22,863 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:22,863 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:22,873 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:47:22,883 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-09-30 10:47:22,883 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:22,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:22,993 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-30 10:47:23,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:23,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-09-30 10:47:23,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:47:23,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:47:23,021 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:23,021 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 13 states. [2018-09-30 10:47:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:24,389 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-09-30 10:47:24,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 10:47:24,390 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-09-30 10:47:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:24,391 INFO L225 Difference]: With dead ends: 50 [2018-09-30 10:47:24,391 INFO L226 Difference]: Without dead ends: 39 [2018-09-30 10:47:24,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-30 10:47:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-09-30 10:47:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 10:47:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-09-30 10:47:24,400 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 19 [2018-09-30 10:47:24,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:24,401 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-09-30 10:47:24,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:47:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-09-30 10:47:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:47:24,402 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:24,402 INFO L375 BasicCegarLoop]: trace histogram [21, 3, 3, 1, 1, 1] [2018-09-30 10:47:24,402 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:24,403 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:24,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1893667570, now seen corresponding path program 7 times [2018-09-30 10:47:24,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:24,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:24,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:24,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:24,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:24,531 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-30 10:47:24,531 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:24,531 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:24,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:24,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:24,753 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-30 10:47:24,773 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:24,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-09-30 10:47:24,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 10:47:24,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 10:47:24,775 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:24,775 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 19 states. [2018-09-30 10:47:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:25,015 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-09-30 10:47:25,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:47:25,023 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-09-30 10:47:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:25,024 INFO L225 Difference]: With dead ends: 55 [2018-09-30 10:47:25,024 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 10:47:25,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 10:47:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-30 10:47:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-30 10:47:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-09-30 10:47:25,036 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 30 [2018-09-30 10:47:25,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:25,037 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-09-30 10:47:25,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 10:47:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-09-30 10:47:25,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-30 10:47:25,038 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:25,038 INFO L375 BasicCegarLoop]: trace histogram [24, 3, 3, 1, 1, 1] [2018-09-30 10:47:25,041 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:25,041 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:25,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1170740991, now seen corresponding path program 8 times [2018-09-30 10:47:25,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:25,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:25,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:25,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:25,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:25,271 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-30 10:47:25,271 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:25,272 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:25,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:47:25,313 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:47:25,313 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:25,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:25,413 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-30 10:47:25,444 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:25,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-09-30 10:47:25,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 10:47:25,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 10:47:25,445 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:25,446 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 21 states. [2018-09-30 10:47:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:25,661 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-09-30 10:47:25,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:47:25,662 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-09-30 10:47:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:25,663 INFO L225 Difference]: With dead ends: 60 [2018-09-30 10:47:25,663 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 10:47:25,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 10:47:25,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-30 10:47:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 10:47:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-09-30 10:47:25,672 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 33 [2018-09-30 10:47:25,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:25,672 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-09-30 10:47:25,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 10:47:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-09-30 10:47:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 10:47:25,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:25,674 INFO L375 BasicCegarLoop]: trace histogram [27, 3, 3, 1, 1, 1] [2018-09-30 10:47:25,674 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:25,674 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:25,674 INFO L82 PathProgramCache]: Analyzing trace with hash 251197998, now seen corresponding path program 9 times [2018-09-30 10:47:25,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:25,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:25,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:25,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:25,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:25,975 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-30 10:47:25,975 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:25,975 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:25,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:47:26,165 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-09-30 10:47:26,166 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:26,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:26,722 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-30 10:47:26,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:26,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-09-30 10:47:26,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-30 10:47:26,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-30 10:47:26,745 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:26,746 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 23 states. [2018-09-30 10:47:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:26,959 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-09-30 10:47:26,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:47:26,960 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-09-30 10:47:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:26,960 INFO L225 Difference]: With dead ends: 65 [2018-09-30 10:47:26,960 INFO L226 Difference]: Without dead ends: 40 [2018-09-30 10:47:26,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-30 10:47:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-30 10:47:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-30 10:47:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-09-30 10:47:26,970 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2018-09-30 10:47:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:26,970 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-09-30 10:47:26,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-30 10:47:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-09-30 10:47:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-30 10:47:26,971 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:26,972 INFO L375 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2018-09-30 10:47:26,972 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:26,972 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:26,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1180066335, now seen corresponding path program 10 times [2018-09-30 10:47:26,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:26,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:26,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:26,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:26,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:27,136 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-30 10:47:27,137 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:27,137 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:27,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:47:27,206 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:47:27,207 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:27,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:27,356 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-30 10:47:27,386 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:27,386 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-30 10:47:27,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:47:27,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:47:27,387 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:27,387 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2018-09-30 10:47:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:27,627 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-09-30 10:47:27,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:47:27,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-09-30 10:47:27,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:27,628 INFO L225 Difference]: With dead ends: 65 [2018-09-30 10:47:27,628 INFO L226 Difference]: Without dead ends: 63 [2018-09-30 10:47:27,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-30 10:47:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-09-30 10:47:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 10:47:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-09-30 10:47:27,645 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-09-30 10:47:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:27,646 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-09-30 10:47:27,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:47:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-09-30 10:47:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-30 10:47:27,648 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:27,648 INFO L375 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2018-09-30 10:47:27,648 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:27,648 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:27,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1381898283, now seen corresponding path program 11 times [2018-09-30 10:47:27,649 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:27,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:27,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:27,832 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-30 10:47:27,832 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:27,833 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:27,842 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:47:27,907 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-09-30 10:47:27,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:27,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:28,512 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-30 10:47:28,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:28,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-09-30 10:47:28,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:47:28,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:47:28,533 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:28,534 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 12 states. [2018-09-30 10:47:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:28,618 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-09-30 10:47:28,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:47:28,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-09-30 10:47:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:28,620 INFO L225 Difference]: With dead ends: 77 [2018-09-30 10:47:28,620 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 10:47:28,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 10:47:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2018-09-30 10:47:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-30 10:47:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-09-30 10:47:28,635 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2018-09-30 10:47:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:28,635 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-09-30 10:47:28,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:47:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-09-30 10:47:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-30 10:47:28,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:28,637 INFO L375 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2018-09-30 10:47:28,637 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:28,637 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:28,637 INFO L82 PathProgramCache]: Analyzing trace with hash -536120459, now seen corresponding path program 12 times [2018-09-30 10:47:28,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:28,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:28,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:28,997 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-30 10:47:28,997 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:28,997 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:29,006 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:47:29,138 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-09-30 10:47:29,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:29,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:29,352 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-30 10:47:29,372 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:29,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 10:47:29,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:47:29,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:47:29,373 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:29,373 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 14 states. [2018-09-30 10:47:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:29,545 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-09-30 10:47:29,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:47:29,546 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-09-30 10:47:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:29,546 INFO L225 Difference]: With dead ends: 89 [2018-09-30 10:47:29,547 INFO L226 Difference]: Without dead ends: 87 [2018-09-30 10:47:29,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-30 10:47:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-09-30 10:47:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-30 10:47:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-09-30 10:47:29,566 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2018-09-30 10:47:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:29,567 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-09-30 10:47:29,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:47:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-09-30 10:47:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-30 10:47:29,568 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:29,568 INFO L375 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2018-09-30 10:47:29,569 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:29,569 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:29,569 INFO L82 PathProgramCache]: Analyzing trace with hash -681037889, now seen corresponding path program 13 times [2018-09-30 10:47:29,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:29,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:29,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:29,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:29,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:29,732 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-30 10:47:29,732 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:29,733 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:29,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:29,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:30,056 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-30 10:47:30,079 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:30,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-30 10:47:30,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:47:30,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:47:30,080 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:30,080 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 16 states. [2018-09-30 10:47:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:30,220 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-09-30 10:47:30,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:47:30,222 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-09-30 10:47:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:30,223 INFO L225 Difference]: With dead ends: 101 [2018-09-30 10:47:30,223 INFO L226 Difference]: Without dead ends: 99 [2018-09-30 10:47:30,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-30 10:47:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-09-30 10:47:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-30 10:47:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-09-30 10:47:30,245 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2018-09-30 10:47:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:30,246 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-09-30 10:47:30,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:47:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-09-30 10:47:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-30 10:47:30,247 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:30,247 INFO L375 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-09-30 10:47:30,248 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:30,248 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:30,248 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 14 times [2018-09-30 10:47:30,248 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:30,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:30,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:30,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:30,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:30,511 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-30 10:47:30,512 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:30,512 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:30,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:47:30,599 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:47:30,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:30,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:31,040 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-30 10:47:31,060 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:31,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-09-30 10:47:31,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:47:31,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:47:31,061 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:31,062 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 18 states. [2018-09-30 10:47:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:31,319 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-09-30 10:47:31,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:47:31,320 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-09-30 10:47:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:31,321 INFO L225 Difference]: With dead ends: 113 [2018-09-30 10:47:31,321 INFO L226 Difference]: Without dead ends: 111 [2018-09-30 10:47:31,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-30 10:47:31,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-09-30 10:47:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-30 10:47:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-09-30 10:47:31,346 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-09-30 10:47:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:31,346 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-09-30 10:47:31,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:47:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-09-30 10:47:31,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-30 10:47:31,348 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:31,348 INFO L375 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-09-30 10:47:31,348 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:31,348 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:31,349 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 15 times [2018-09-30 10:47:31,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:31,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:31,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:31,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:31,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:31,553 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-30 10:47:31,553 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:31,553 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:31,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:47:31,769 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-09-30 10:47:31,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:31,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:32,019 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-30 10:47:32,041 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:32,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-30 10:47:32,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 10:47:32,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 10:47:32,041 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:32,042 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 20 states. [2018-09-30 10:47:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:32,197 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-09-30 10:47:32,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:47:32,197 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-09-30 10:47:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:32,198 INFO L225 Difference]: With dead ends: 125 [2018-09-30 10:47:32,198 INFO L226 Difference]: Without dead ends: 123 [2018-09-30 10:47:32,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-30 10:47:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-09-30 10:47:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-30 10:47:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-09-30 10:47:32,225 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-09-30 10:47:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:32,225 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-09-30 10:47:32,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 10:47:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-09-30 10:47:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-30 10:47:32,227 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:32,227 INFO L375 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-09-30 10:47:32,228 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:32,228 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:32,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 16 times [2018-09-30 10:47:32,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:32,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:32,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:32,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:32,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:32,542 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-30 10:47:32,542 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:32,542 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:47:32,549 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:47:32,642 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:47:32,643 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:32,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:32,910 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-30 10:47:32,931 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:32,931 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-09-30 10:47:32,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 10:47:32,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 10:47:32,932 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:32,932 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 22 states. [2018-09-30 10:47:33,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:33,143 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-09-30 10:47:33,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:47:33,146 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-09-30 10:47:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:33,147 INFO L225 Difference]: With dead ends: 137 [2018-09-30 10:47:33,147 INFO L226 Difference]: Without dead ends: 135 [2018-09-30 10:47:33,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-30 10:47:33,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-09-30 10:47:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-30 10:47:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-09-30 10:47:33,181 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-09-30 10:47:33,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:33,182 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-09-30 10:47:33,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 10:47:33,182 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-09-30 10:47:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-30 10:47:33,183 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:33,183 INFO L375 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-09-30 10:47:33,183 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:33,184 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:33,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 17 times [2018-09-30 10:47:33,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:33,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:33,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:37,027 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-30 10:47:37,027 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:47:37,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-09-30 10:47:37,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-30 10:47:37,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-30 10:47:37,032 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:37,033 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2018-09-30 10:47:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:41,143 INFO L93 Difference]: Finished difference Result 5119 states and 5579 transitions. [2018-09-30 10:47:41,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-30 10:47:41,143 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2018-09-30 10:47:41,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:41,144 INFO L225 Difference]: With dead ends: 5119 [2018-09-30 10:47:41,144 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:47:41,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:41,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:47:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:47:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:47:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:47:41,152 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2018-09-30 10:47:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:41,153 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:47:41,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-30 10:47:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:47:41,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:47:41,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:47:47,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:47,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:48,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:49,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:50,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:50,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:50,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:50,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:50,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:50,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:50,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:50,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:50,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:50,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:50,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:51,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:52,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:52,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:52,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:52,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:52,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:52,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:52,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:52,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:52,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:52,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:53,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:53,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:53,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:53,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:53,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:53,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:54,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:54,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:54,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:54,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:54,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:54,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:54,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:55,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:55,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:55,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:55,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:55,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:56,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:56,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:56,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:56,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:56,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:56,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:56,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:57,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:57,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:57,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:57,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:57,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:57,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:58,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:58,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:58,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:58,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:59,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:59,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:59,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:59,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:59,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:59,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:59,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:47:59,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:00,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:00,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:00,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:01,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:01,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:01,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:01,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:01,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:02,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:02,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:02,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:02,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:03,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:03,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:03,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:03,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:03,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:03,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:03,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:03,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:04,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:04,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:04,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:05,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:05,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:06,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:06,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:06,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:06,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:07,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:08,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:08,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:09,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:09,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:09,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:10,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:10,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:12,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:12,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:13,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:14,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:14,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:14,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:15,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:16,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:16,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:16,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:16,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:17,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:17,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:17,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:17,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:18,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:19,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:19,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:21,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:21,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:21,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:22,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:22,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:22,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:23,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:24,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:24,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:24,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:26,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:27,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:28,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:28,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:28,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:29,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:31,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:31,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:31,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:38,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:38,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:40,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:40,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:41,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:43,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:48,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:48,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:50,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:53,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:53,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:48:55,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:49:10,495 WARN L178 SmtUtils]: Spent 1.49 m on a formula simplification. DAG size of input: 5112 DAG size of output: 2150 [2018-09-30 10:49:11,335 WARN L178 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-09-30 10:50:40,913 WARN L178 SmtUtils]: Spent 1.49 m on a formula simplification. DAG size of input: 2150 DAG size of output: 362 [2018-09-30 10:50:48,056 WARN L178 SmtUtils]: Spent 7.13 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-09-30 10:50:48,062 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-09-30 10:50:48,063 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-30 10:50:48,063 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2018-09-30 10:50:48,063 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-09-30 10:50:48,064 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2018-09-30 10:50:48,064 INFO L422 ceAbstractionStarter]: At program point L45(lines 45 50) the Hoare annotation is: false [2018-09-30 10:50:48,064 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-30 10:50:48,100 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:50:48 BoogieIcfgContainer [2018-09-30 10:50:48,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:50:48,101 INFO L168 Benchmark]: Toolchain (without parser) took 210212.16 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-09-30 10:50:48,103 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:50:48,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:50:48,104 INFO L168 Benchmark]: Boogie Preprocessor took 23.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:50:48,104 INFO L168 Benchmark]: RCFGBuilder took 332.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:50:48,105 INFO L168 Benchmark]: TraceAbstraction took 209806.35 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-09-30 10:50:48,109 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 332.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 209806.35 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.9 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, 209.6s OverallTime, 19 OverallIterations, 100 TraceHistogramMax, 9.9s AutomataDifference, 0.0s DeadEndRemovalTime, 186.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 392 SDslu, 554 SDs, 0 SdLazy, 744 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s 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.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 251704 FormulaSimplificationTreeSizeReductionInter, 96.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.1s 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-30_10-50-48-141.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-30_10-50-48-141.csv Received shutdown request...