java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:34:15,722 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:34:15,724 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:34:15,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:34:15,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:34:15,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:34:15,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:34:15,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:34:15,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:34:15,750 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:34:15,756 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:34:15,757 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:34:15,761 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:34:15,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:34:15,763 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:34:15,765 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:34:15,767 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:34:15,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:34:15,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:34:15,775 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:34:15,778 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:34:15,779 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:34:15,782 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:34:15,782 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:34:15,782 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:34:15,785 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:34:15,786 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:34:15,787 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:34:15,790 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:34:15,792 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:34:15,792 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:34:15,793 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:34:15,793 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:34:15,794 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:34:15,794 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:34:15,795 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:34:15,795 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 10:34:15,812 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:34:15,812 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:34:15,813 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:34:15,813 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:34:15,814 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:34:15,814 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:34:15,814 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:34:15,814 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:34:15,814 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:34:15,815 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:34:15,815 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:34:15,815 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:34:15,815 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:34:15,815 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:34:15,815 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:34:15,816 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:34:15,816 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:34:15,816 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:34:15,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:34:15,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:34:15,817 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:34:15,817 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:34:15,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:34:15,817 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:34:15,817 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:34:15,818 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:34:15,818 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:34:15,818 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:34:15,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:34:15,818 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:34:15,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:34:15,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:34:15,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:34:15,879 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:34:15,880 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:34:15,880 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2018-09-30 10:34:15,881 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2018-09-30 10:34:15,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:34:15,947 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:34:15,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:34:15,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:34:15,948 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:34:15,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:15" (1/1) ... [2018-09-30 10:34:15,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:15" (1/1) ... [2018-09-30 10:34:15,997 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:34:15,997 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:34:15,998 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:34:16,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:34:16,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:34:16,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:34:16,018 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:34:16,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:15" (1/1) ... [2018-09-30 10:34:16,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:15" (1/1) ... [2018-09-30 10:34:16,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:15" (1/1) ... [2018-09-30 10:34:16,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:15" (1/1) ... [2018-09-30 10:34:16,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:15" (1/1) ... [2018-09-30 10:34:16,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:15" (1/1) ... [2018-09-30 10:34:16,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:15" (1/1) ... [2018-09-30 10:34:16,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:34:16,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:34:16,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:34:16,048 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:34:16,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:34:16,118 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-30 10:34:16,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-30 10:34:16,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-30 10:34:16,119 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-30 10:34:16,503 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:34:16,504 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:34:16 BoogieIcfgContainer [2018-09-30 10:34:16,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:34:16,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:34:16,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:34:16,508 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:34:16,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:15" (1/2) ... [2018-09-30 10:34:16,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efe3345 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:34:16, skipping insertion in model container [2018-09-30 10:34:16,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:34:16" (2/2) ... [2018-09-30 10:34:16,512 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2018-09-30 10:34:16,522 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:34:16,530 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-30 10:34:16,581 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:34:16,581 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:34:16,582 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:34:16,582 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:34:16,582 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:34:16,582 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:34:16,582 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:34:16,583 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:34:16,583 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:34:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-09-30 10:34:16,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 10:34:16,605 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:16,606 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 10:34:16,607 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:16,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-30 10:34:16,618 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:16,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:16,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:16,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:16,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:16,857 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:34:16,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:34:16,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:34:16,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:34:16,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:34:16,876 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2018-09-30 10:34:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:16,992 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-09-30 10:34:16,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:34:16,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-30 10:34:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:17,007 INFO L225 Difference]: With dead ends: 20 [2018-09-30 10:34:17,007 INFO L226 Difference]: Without dead ends: 10 [2018-09-30 10:34:17,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:34:17,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-30 10:34:17,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2018-09-30 10:34:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-30 10:34:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-09-30 10:34:17,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-09-30 10:34:17,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:17,048 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-09-30 10:34:17,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:34:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-09-30 10:34:17,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:34:17,049 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:17,049 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:34:17,049 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:17,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:17,050 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2018-09-30 10:34:17,050 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:17,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:17,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:17,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:17,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:17,367 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:34:17,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:34:17,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:34:17,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:34:17,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:34:17,370 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-09-30 10:34:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:17,603 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-09-30 10:34:17,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:34:17,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 10:34:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:17,604 INFO L225 Difference]: With dead ends: 17 [2018-09-30 10:34:17,604 INFO L226 Difference]: Without dead ends: 16 [2018-09-30 10:34:17,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:34:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-30 10:34:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-09-30 10:34:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 10:34:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-09-30 10:34:17,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2018-09-30 10:34:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:17,611 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-09-30 10:34:17,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:34:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-09-30 10:34:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:34:17,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:17,612 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:34:17,613 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:17,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:17,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2018-09-30 10:34:17,614 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:17,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:17,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:17,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:17,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:17,686 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:34:17,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:34:17,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:34:17,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:34:17,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:34:17,687 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2018-09-30 10:34:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:17,725 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-09-30 10:34:17,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:34:17,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-09-30 10:34:17,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:17,727 INFO L225 Difference]: With dead ends: 18 [2018-09-30 10:34:17,727 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 10:34:17,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:34:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 10:34:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 10:34:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 10:34:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-30 10:34:17,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-30 10:34:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:17,736 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-30 10:34:17,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:34:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-30 10:34:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:34:17,737 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:17,737 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2018-09-30 10:34:17,738 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:17,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:17,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2018-09-30 10:34:17,739 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:17,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:17,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:17,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:17,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:18,008 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:18,008 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:18,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:18,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:18,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:18,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:18,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:18,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:18,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:18,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-30 10:34:18,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:34:18,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:34:18,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:34:18,339 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-09-30 10:34:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:18,676 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-30 10:34:18,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:34:18,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-30 10:34:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:18,681 INFO L225 Difference]: With dead ends: 20 [2018-09-30 10:34:18,681 INFO L226 Difference]: Without dead ends: 19 [2018-09-30 10:34:18,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-09-30 10:34:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-30 10:34:18,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-09-30 10:34:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-30 10:34:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-30 10:34:18,687 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-09-30 10:34:18,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:18,688 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-30 10:34:18,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:34:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-30 10:34:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:34:18,689 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:18,689 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-09-30 10:34:18,689 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:18,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:18,690 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2018-09-30 10:34:18,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:18,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:18,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:18,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:18,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:18,880 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:18,881 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:18,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:34:18,924 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:34:18,924 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:18,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:18,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:18,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:18,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:18,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:19,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:19,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-30 10:34:19,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:34:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:34:19,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-09-30 10:34:19,083 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2018-09-30 10:34:19,448 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:34:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:19,586 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-30 10:34:19,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:34:19,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-30 10:34:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:19,590 INFO L225 Difference]: With dead ends: 25 [2018-09-30 10:34:19,590 INFO L226 Difference]: Without dead ends: 24 [2018-09-30 10:34:19,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:34:19,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-30 10:34:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-09-30 10:34:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-30 10:34:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-30 10:34:19,596 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-09-30 10:34:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:19,597 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-30 10:34:19,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:34:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-30 10:34:19,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:34:19,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:19,598 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2018-09-30 10:34:19,599 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:19,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:19,599 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2018-09-30 10:34:19,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:19,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:19,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:19,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:19,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:19,741 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:19,741 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:19,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:34:19,800 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-30 10:34:19,801 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:19,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:19,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:19,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:19,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:19,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:19,979 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:19,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-30 10:34:19,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:34:19,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:34:19,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-09-30 10:34:19,981 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-30 10:34:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:20,317 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-30 10:34:20,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:34:20,319 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-30 10:34:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:20,321 INFO L225 Difference]: With dead ends: 30 [2018-09-30 10:34:20,321 INFO L226 Difference]: Without dead ends: 29 [2018-09-30 10:34:20,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:34:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-30 10:34:20,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-09-30 10:34:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-30 10:34:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-30 10:34:20,328 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-09-30 10:34:20,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:20,328 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-30 10:34:20,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:34:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-30 10:34:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-30 10:34:20,330 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:20,330 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2018-09-30 10:34:20,330 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:20,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:20,331 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2018-09-30 10:34:20,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:20,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:20,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:20,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:20,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:20,576 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:20,576 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:20,586 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:34:20,628 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:34:20,628 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:20,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:20,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:20,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:20,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:20,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:20,804 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:20,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 10:34:20,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:34:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:34:20,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:34:20,807 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-09-30 10:34:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:21,066 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-30 10:34:21,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:34:21,067 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-09-30 10:34:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:21,068 INFO L225 Difference]: With dead ends: 35 [2018-09-30 10:34:21,068 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 10:34:21,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:34:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 10:34:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-09-30 10:34:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 10:34:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-30 10:34:21,077 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-09-30 10:34:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:21,077 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-30 10:34:21,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:34:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-30 10:34:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:34:21,078 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:21,078 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2018-09-30 10:34:21,079 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:21,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:21,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2018-09-30 10:34:21,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:21,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:21,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:21,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:21,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:21,235 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:21,235 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:21,244 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:34:21,281 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-30 10:34:21,282 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:21,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:21,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:21,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:21,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:21,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:21,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:21,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 10:34:21,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:34:21,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:34:21,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:34:21,565 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-09-30 10:34:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:22,176 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-30 10:34:22,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:34:22,177 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-09-30 10:34:22,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:22,178 INFO L225 Difference]: With dead ends: 40 [2018-09-30 10:34:22,178 INFO L226 Difference]: Without dead ends: 39 [2018-09-30 10:34:22,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2018-09-30 10:34:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-30 10:34:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-09-30 10:34:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-30 10:34:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-30 10:34:22,186 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-09-30 10:34:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:22,187 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-30 10:34:22,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:34:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-30 10:34:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-30 10:34:22,188 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:22,188 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2018-09-30 10:34:22,189 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:22,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:22,189 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2018-09-30 10:34:22,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:22,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:22,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:22,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:22,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:22,560 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:22,560 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:22,568 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:34:22,606 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 10:34:22,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:22,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:22,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:22,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:22,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:22,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:22,878 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:22,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-30 10:34:22,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:34:22,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:34:22,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:34:22,880 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2018-09-30 10:34:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:23,226 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-30 10:34:23,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:34:23,227 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-09-30 10:34:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:23,228 INFO L225 Difference]: With dead ends: 45 [2018-09-30 10:34:23,228 INFO L226 Difference]: Without dead ends: 44 [2018-09-30 10:34:23,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-09-30 10:34:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-30 10:34:23,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-09-30 10:34:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-30 10:34:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-30 10:34:23,237 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-09-30 10:34:23,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:23,237 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-30 10:34:23,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:34:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-30 10:34:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 10:34:23,239 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:23,239 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2018-09-30 10:34:23,239 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:23,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:23,240 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2018-09-30 10:34:23,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:23,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:23,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:23,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:23,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:23,447 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:23,447 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:23,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:23,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:23,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:23,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:23,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:23,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:23,740 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:23,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-30 10:34:23,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 10:34:23,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 10:34:23,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:34:23,741 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2018-09-30 10:34:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:24,074 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-30 10:34:24,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:34:24,075 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-09-30 10:34:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:24,076 INFO L225 Difference]: With dead ends: 50 [2018-09-30 10:34:24,076 INFO L226 Difference]: Without dead ends: 49 [2018-09-30 10:34:24,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=532, Unknown=0, NotChecked=0, Total=812 [2018-09-30 10:34:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-30 10:34:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-09-30 10:34:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-30 10:34:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-30 10:34:24,086 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-09-30 10:34:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:24,086 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-30 10:34:24,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 10:34:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-30 10:34:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 10:34:24,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:24,088 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2018-09-30 10:34:24,088 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:24,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:24,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2018-09-30 10:34:24,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:24,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:24,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:24,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:24,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:24,373 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:24,373 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:24,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:34:24,412 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:34:24,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:24,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:24,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:24,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:24,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:24,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:24,839 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:24,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-30 10:34:24,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 10:34:24,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 10:34:24,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2018-09-30 10:34:24,841 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2018-09-30 10:34:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:25,359 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-30 10:34:25,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:34:25,360 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-09-30 10:34:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:25,361 INFO L225 Difference]: With dead ends: 55 [2018-09-30 10:34:25,361 INFO L226 Difference]: Without dead ends: 54 [2018-09-30 10:34:25,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2018-09-30 10:34:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-30 10:34:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-30 10:34:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-30 10:34:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-30 10:34:25,371 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-09-30 10:34:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:25,371 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-30 10:34:25,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 10:34:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-30 10:34:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 10:34:25,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:25,373 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2018-09-30 10:34:25,373 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:25,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:25,373 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2018-09-30 10:34:25,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:25,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:25,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:25,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:25,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:25,786 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:25,787 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:25,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:34:25,925 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-30 10:34:25,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:25,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:25,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:25,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:25,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:25,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:26,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:26,346 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-30 10:34:26,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-30 10:34:26,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-30 10:34:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-09-30 10:34:26,347 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2018-09-30 10:34:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:26,946 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-30 10:34:26,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:34:26,949 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-09-30 10:34:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:26,950 INFO L225 Difference]: With dead ends: 60 [2018-09-30 10:34:26,950 INFO L226 Difference]: Without dead ends: 59 [2018-09-30 10:34:26,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=408, Invalid=782, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 10:34:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-30 10:34:26,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-09-30 10:34:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-30 10:34:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-30 10:34:26,960 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-09-30 10:34:26,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:26,961 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-30 10:34:26,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-30 10:34:26,961 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-30 10:34:26,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-30 10:34:26,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:26,962 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2018-09-30 10:34:26,962 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:26,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:26,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2018-09-30 10:34:26,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:26,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:26,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:26,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:26,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:27,250 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:27,250 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:27,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:34:27,302 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:34:27,302 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:27,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:27,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:27,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:27,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:27,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:27,573 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:27,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-30 10:34:27,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-30 10:34:27,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-30 10:34:27,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-09-30 10:34:27,575 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2018-09-30 10:34:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:28,014 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-30 10:34:28,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:34:28,015 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-09-30 10:34:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:28,016 INFO L225 Difference]: With dead ends: 65 [2018-09-30 10:34:28,016 INFO L226 Difference]: Without dead ends: 64 [2018-09-30 10:34:28,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=481, Invalid=925, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 10:34:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-30 10:34:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-09-30 10:34:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-30 10:34:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-30 10:34:28,027 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-09-30 10:34:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:28,028 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-30 10:34:28,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-30 10:34:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-30 10:34:28,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-30 10:34:28,029 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:28,029 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2018-09-30 10:34:28,029 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:28,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:28,030 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2018-09-30 10:34:28,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:28,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:28,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:28,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:28,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:28,326 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:28,326 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:28,334 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:34:28,404 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-30 10:34:28,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:28,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:28,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:28,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:28,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:28,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:28,716 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:28,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-30 10:34:28,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-30 10:34:28,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-30 10:34:28,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=493, Unknown=0, NotChecked=0, Total=756 [2018-09-30 10:34:28,718 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-09-30 10:34:29,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:29,241 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-30 10:34:29,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:34:29,242 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-09-30 10:34:29,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:29,243 INFO L225 Difference]: With dead ends: 70 [2018-09-30 10:34:29,243 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 10:34:29,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=560, Invalid=1080, Unknown=0, NotChecked=0, Total=1640 [2018-09-30 10:34:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 10:34:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-09-30 10:34:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-30 10:34:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-30 10:34:29,255 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-09-30 10:34:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:29,256 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-30 10:34:29,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-30 10:34:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-30 10:34:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-30 10:34:29,257 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:29,257 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2018-09-30 10:34:29,257 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:29,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:29,258 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2018-09-30 10:34:29,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:29,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:29,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:29,662 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:29,663 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:29,677 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:34:29,739 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 10:34:29,739 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:29,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:29,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:29,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:29,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:29,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:30,062 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:30,062 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-30 10:34:30,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-30 10:34:30,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-30 10:34:30,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2018-09-30 10:34:30,063 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2018-09-30 10:34:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:30,634 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-30 10:34:30,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:34:30,635 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-09-30 10:34:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:30,635 INFO L225 Difference]: With dead ends: 75 [2018-09-30 10:34:30,635 INFO L226 Difference]: Without dead ends: 74 [2018-09-30 10:34:30,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=645, Invalid=1247, Unknown=0, NotChecked=0, Total=1892 [2018-09-30 10:34:30,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-30 10:34:30,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-09-30 10:34:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-30 10:34:30,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-30 10:34:30,648 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-09-30 10:34:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:30,649 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-30 10:34:30,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-30 10:34:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-30 10:34:30,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-30 10:34:30,650 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:30,650 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2018-09-30 10:34:30,651 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:30,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:30,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2018-09-30 10:34:30,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:30,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:30,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:30,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:30,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:31,598 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:31,598 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:31,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:31,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:31,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:31,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:31,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:31,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:31,954 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:31,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:31,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-30 10:34:31,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-30 10:34:31,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-30 10:34:31,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=644, Unknown=0, NotChecked=0, Total=992 [2018-09-30 10:34:31,978 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2018-09-30 10:34:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:32,801 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-30 10:34:32,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:34:32,802 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2018-09-30 10:34:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:32,803 INFO L225 Difference]: With dead ends: 80 [2018-09-30 10:34:32,803 INFO L226 Difference]: Without dead ends: 79 [2018-09-30 10:34:32,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=736, Invalid=1426, Unknown=0, NotChecked=0, Total=2162 [2018-09-30 10:34:32,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-30 10:34:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-09-30 10:34:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-30 10:34:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-30 10:34:32,815 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-09-30 10:34:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:32,816 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-30 10:34:32,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-30 10:34:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-30 10:34:32,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-30 10:34:32,817 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:32,817 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2018-09-30 10:34:32,818 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:32,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:32,818 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2018-09-30 10:34:32,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:32,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:32,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:32,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:32,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:33,418 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:33,419 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:33,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:34:33,481 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:34:33,482 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:33,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:33,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:33,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:33,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:33,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:33,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:33,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-30 10:34:33,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-30 10:34:33,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-30 10:34:33,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 10:34:33,797 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2018-09-30 10:34:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:34,434 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-30 10:34:34,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:34:34,434 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-09-30 10:34:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:34,435 INFO L225 Difference]: With dead ends: 85 [2018-09-30 10:34:34,435 INFO L226 Difference]: Without dead ends: 84 [2018-09-30 10:34:34,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=833, Invalid=1617, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 10:34:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-30 10:34:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-09-30 10:34:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-30 10:34:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-30 10:34:34,450 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-09-30 10:34:34,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:34,451 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-30 10:34:34,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-30 10:34:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-30 10:34:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-30 10:34:34,453 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:34,453 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2018-09-30 10:34:34,453 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:34,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:34,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2018-09-30 10:34:34,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:34,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:34,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:34,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:34,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:35,496 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:35,496 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:35,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:34:35,588 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-30 10:34:35,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:35,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:35,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:35,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:35,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:35,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:36,220 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:36,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-30 10:34:36,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-30 10:34:36,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-30 10:34:36,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=815, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 10:34:36,221 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2018-09-30 10:34:37,151 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:34:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:37,411 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-30 10:34:37,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 10:34:37,411 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2018-09-30 10:34:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:37,412 INFO L225 Difference]: With dead ends: 90 [2018-09-30 10:34:37,413 INFO L226 Difference]: Without dead ends: 89 [2018-09-30 10:34:37,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=936, Invalid=1820, Unknown=0, NotChecked=0, Total=2756 [2018-09-30 10:34:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-30 10:34:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-09-30 10:34:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-30 10:34:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-30 10:34:37,425 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-09-30 10:34:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:37,426 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-30 10:34:37,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-30 10:34:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-30 10:34:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-30 10:34:37,427 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:37,427 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2018-09-30 10:34:37,427 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:37,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:37,428 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2018-09-30 10:34:37,428 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:37,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:37,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:37,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:37,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:38,430 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:38,430 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:38,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:34:38,499 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:34:38,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:38,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:38,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:38,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:38,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:38,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:38,908 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:38,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-30 10:34:38,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-30 10:34:38,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-30 10:34:38,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=908, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 10:34:38,910 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2018-09-30 10:34:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:39,519 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-30 10:34:39,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:34:39,520 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2018-09-30 10:34:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:39,521 INFO L225 Difference]: With dead ends: 95 [2018-09-30 10:34:39,521 INFO L226 Difference]: Without dead ends: 94 [2018-09-30 10:34:39,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1045, Invalid=2035, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 10:34:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-30 10:34:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-09-30 10:34:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-30 10:34:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-30 10:34:39,533 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-09-30 10:34:39,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:39,533 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-30 10:34:39,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-30 10:34:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-30 10:34:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-30 10:34:39,534 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:39,534 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2018-09-30 10:34:39,534 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:39,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:39,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2018-09-30 10:34:39,535 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:39,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:39,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:39,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:39,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:39,959 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:39,959 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:39,967 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:34:40,050 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-30 10:34:40,050 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:40,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:40,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:40,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:40,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:40,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:40,446 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:40,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-30 10:34:40,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-30 10:34:40,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-30 10:34:40,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1006, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 10:34:40,447 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2018-09-30 10:34:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:41,311 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-30 10:34:41,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:34:41,312 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2018-09-30 10:34:41,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:41,312 INFO L225 Difference]: With dead ends: 100 [2018-09-30 10:34:41,313 INFO L226 Difference]: Without dead ends: 99 [2018-09-30 10:34:41,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1160, Invalid=2262, Unknown=0, NotChecked=0, Total=3422 [2018-09-30 10:34:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-30 10:34:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-09-30 10:34:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-30 10:34:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-30 10:34:41,325 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-09-30 10:34:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:41,325 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-30 10:34:41,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-30 10:34:41,325 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-30 10:34:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-30 10:34:41,326 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:41,326 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2018-09-30 10:34:41,327 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:41,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:41,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2018-09-30 10:34:41,327 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:41,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:41,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:41,755 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:41,755 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:41,764 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:34:41,860 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-30 10:34:41,860 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:41,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:41,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:41,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:41,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:41,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:42,255 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:42,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-30 10:34:42,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-30 10:34:42,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-30 10:34:42,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=1109, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 10:34:42,256 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2018-09-30 10:34:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:43,039 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-30 10:34:43,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:34:43,039 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2018-09-30 10:34:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:43,040 INFO L225 Difference]: With dead ends: 105 [2018-09-30 10:34:43,040 INFO L226 Difference]: Without dead ends: 104 [2018-09-30 10:34:43,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1281, Invalid=2501, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 10:34:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-30 10:34:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-09-30 10:34:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-30 10:34:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-30 10:34:43,056 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-09-30 10:34:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:43,056 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-30 10:34:43,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-30 10:34:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-30 10:34:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-30 10:34:43,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:43,057 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2018-09-30 10:34:43,058 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:43,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:43,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2018-09-30 10:34:43,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:43,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:43,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:43,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:43,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:43,603 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:43,604 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:43,604 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-09-30 10:34:43,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:43,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:43,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:43,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:43,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:43,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:44,111 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:44,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-30 10:34:44,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-30 10:34:44,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-30 10:34:44,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1217, Unknown=0, NotChecked=0, Total=1892 [2018-09-30 10:34:44,113 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2018-09-30 10:34:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:44,883 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-30 10:34:44,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:34:44,886 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2018-09-30 10:34:44,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:44,887 INFO L225 Difference]: With dead ends: 110 [2018-09-30 10:34:44,887 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 10:34:44,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1408, Invalid=2752, Unknown=0, NotChecked=0, Total=4160 [2018-09-30 10:34:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 10:34:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-09-30 10:34:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-30 10:34:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-30 10:34:44,902 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-09-30 10:34:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:44,902 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-30 10:34:44,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-30 10:34:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-30 10:34:44,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-30 10:34:44,903 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:44,903 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2018-09-30 10:34:44,903 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:44,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:44,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2018-09-30 10:34:44,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:44,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:44,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:44,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:44,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:45,531 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:45,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:45,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:34:45,611 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:34:45,611 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:45,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:45,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:45,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:45,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:45,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:47,454 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:47,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-30 10:34:47,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-30 10:34:47,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-30 10:34:47,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=1330, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 10:34:47,455 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2018-09-30 10:34:48,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:48,285 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-30 10:34:48,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:34:48,285 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2018-09-30 10:34:48,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:48,286 INFO L225 Difference]: With dead ends: 115 [2018-09-30 10:34:48,286 INFO L226 Difference]: Without dead ends: 114 [2018-09-30 10:34:48,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1541, Invalid=3015, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 10:34:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-30 10:34:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-09-30 10:34:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-30 10:34:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-30 10:34:48,300 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-09-30 10:34:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:48,301 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-30 10:34:48,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-30 10:34:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-30 10:34:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-30 10:34:48,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:48,301 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2018-09-30 10:34:48,302 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:48,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:48,302 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2018-09-30 10:34:48,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:48,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:48,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:48,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:48,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:48,847 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:48,847 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:48,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:34:48,970 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-30 10:34:48,970 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:48,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:48,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:48,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:48,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:48,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:49,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:49,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-30 10:34:49,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-30 10:34:49,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-30 10:34:49,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=1448, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 10:34:49,492 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2018-09-30 10:34:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:50,404 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-30 10:34:50,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 10:34:50,404 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2018-09-30 10:34:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:50,405 INFO L225 Difference]: With dead ends: 120 [2018-09-30 10:34:50,405 INFO L226 Difference]: Without dead ends: 119 [2018-09-30 10:34:50,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1680, Invalid=3290, Unknown=0, NotChecked=0, Total=4970 [2018-09-30 10:34:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-30 10:34:50,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-09-30 10:34:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-30 10:34:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-30 10:34:50,425 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-09-30 10:34:50,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:50,425 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-30 10:34:50,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-30 10:34:50,425 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-30 10:34:50,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-30 10:34:50,426 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:50,426 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2018-09-30 10:34:50,427 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:50,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:50,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2018-09-30 10:34:50,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:50,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:50,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:50,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:50,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:50,874 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:50,874 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:50,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:34:50,960 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:34:50,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:50,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:50,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:50,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:51,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:51,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:51,851 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:51,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-30 10:34:51,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 10:34:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 10:34:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=1571, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 10:34:51,852 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2018-09-30 10:34:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:52,781 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-30 10:34:52,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:34:52,781 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2018-09-30 10:34:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:52,782 INFO L225 Difference]: With dead ends: 125 [2018-09-30 10:34:52,782 INFO L226 Difference]: Without dead ends: 124 [2018-09-30 10:34:52,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1825, Invalid=3577, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 10:34:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-30 10:34:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-09-30 10:34:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-30 10:34:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-30 10:34:52,797 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-09-30 10:34:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:52,797 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-30 10:34:52,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 10:34:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-30 10:34:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-30 10:34:52,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:52,798 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2018-09-30 10:34:52,798 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:52,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2018-09-30 10:34:52,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:52,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:52,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:52,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:52,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:53,739 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:53,739 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:53,764 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:34:53,886 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-30 10:34:53,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:53,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:53,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:53,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:53,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:53,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:54,391 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:54,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-30 10:34:54,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-30 10:34:54,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-30 10:34:54,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1699, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 10:34:54,393 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2018-09-30 10:34:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:55,520 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-30 10:34:55,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:34:55,520 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2018-09-30 10:34:55,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:55,521 INFO L225 Difference]: With dead ends: 130 [2018-09-30 10:34:55,521 INFO L226 Difference]: Without dead ends: 129 [2018-09-30 10:34:55,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1976, Invalid=3876, Unknown=0, NotChecked=0, Total=5852 [2018-09-30 10:34:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-30 10:34:55,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-09-30 10:34:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-30 10:34:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-30 10:34:55,538 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-09-30 10:34:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:55,539 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-30 10:34:55,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-30 10:34:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-30 10:34:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-30 10:34:55,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:55,539 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2018-09-30 10:34:55,540 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:55,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:55,540 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2018-09-30 10:34:55,540 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:55,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:55,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:55,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:55,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:56,022 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:56,023 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:56,032 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:34:56,163 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-30 10:34:56,164 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:56,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:56,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:56,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:56,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:56,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:56,959 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:56,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-30 10:34:56,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-30 10:34:56,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-30 10:34:56,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1030, Invalid=1832, Unknown=0, NotChecked=0, Total=2862 [2018-09-30 10:34:56,961 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2018-09-30 10:34:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:57,942 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-30 10:34:57,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:34:57,942 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2018-09-30 10:34:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:57,943 INFO L225 Difference]: With dead ends: 135 [2018-09-30 10:34:57,944 INFO L226 Difference]: Without dead ends: 134 [2018-09-30 10:34:57,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2133, Invalid=4187, Unknown=0, NotChecked=0, Total=6320 [2018-09-30 10:34:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-30 10:34:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-09-30 10:34:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-30 10:34:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-30 10:34:57,966 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-09-30 10:34:57,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:57,967 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-30 10:34:57,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-30 10:34:57,967 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-30 10:34:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-30 10:34:57,968 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:57,968 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2018-09-30 10:34:57,968 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:34:57,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:57,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2018-09-30 10:34:57,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:57,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:57,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:57,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:57,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:59,061 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:59,061 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:59,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:59,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:59,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:34:59,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:59,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:34:59,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:59,842 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:59,843 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-30 10:34:59,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-30 10:34:59,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-30 10:34:59,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1110, Invalid=1970, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 10:34:59,844 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2018-09-30 10:35:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:00,890 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-30 10:35:00,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:35:00,891 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2018-09-30 10:35:00,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:00,892 INFO L225 Difference]: With dead ends: 140 [2018-09-30 10:35:00,892 INFO L226 Difference]: Without dead ends: 139 [2018-09-30 10:35:00,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2296, Invalid=4510, Unknown=0, NotChecked=0, Total=6806 [2018-09-30 10:35:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-30 10:35:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-09-30 10:35:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-30 10:35:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-30 10:35:00,915 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-09-30 10:35:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:00,915 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-30 10:35:00,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-30 10:35:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-30 10:35:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-30 10:35:00,916 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:00,916 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2018-09-30 10:35:00,916 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:00,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:00,917 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2018-09-30 10:35:00,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:00,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:00,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:00,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:00,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:01,780 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:01,780 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:01,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:35:01,877 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:35:01,877 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:01,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:01,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:01,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:02,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:02,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:03,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:03,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-30 10:35:03,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 10:35:03,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 10:35:03,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=2113, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 10:35:03,246 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2018-09-30 10:35:04,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:04,319 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-30 10:35:04,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 10:35:04,320 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2018-09-30 10:35:04,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:04,321 INFO L225 Difference]: With dead ends: 145 [2018-09-30 10:35:04,321 INFO L226 Difference]: Without dead ends: 144 [2018-09-30 10:35:04,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2465, Invalid=4845, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 10:35:04,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-30 10:35:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-09-30 10:35:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-30 10:35:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-30 10:35:04,348 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-09-30 10:35:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:04,348 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-30 10:35:04,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 10:35:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-30 10:35:04,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-30 10:35:04,349 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:04,349 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2018-09-30 10:35:04,350 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:04,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:04,350 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2018-09-30 10:35:04,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:04,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:04,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:04,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:04,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:05,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:05,089 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:05,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:35:05,258 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-30 10:35:05,259 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:05,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:05,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:05,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:05,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:05,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:06,160 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:06,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-30 10:35:06,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-30 10:35:06,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-30 10:35:06,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=2261, Unknown=0, NotChecked=0, Total=3540 [2018-09-30 10:35:06,162 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2018-09-30 10:35:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:07,598 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-30 10:35:07,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 10:35:07,599 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2018-09-30 10:35:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:07,600 INFO L225 Difference]: With dead ends: 150 [2018-09-30 10:35:07,600 INFO L226 Difference]: Without dead ends: 149 [2018-09-30 10:35:07,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2640, Invalid=5192, Unknown=0, NotChecked=0, Total=7832 [2018-09-30 10:35:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-30 10:35:07,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-09-30 10:35:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-30 10:35:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-30 10:35:07,620 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-09-30 10:35:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:07,620 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-30 10:35:07,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-30 10:35:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-30 10:35:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-30 10:35:07,621 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:07,621 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2018-09-30 10:35:07,622 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:07,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:07,622 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2018-09-30 10:35:07,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:07,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:07,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:07,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:08,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:08,329 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:08,329 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:08,338 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:35:08,438 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:35:08,439 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:08,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:08,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:08,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:08,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:08,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:09,285 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:09,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-30 10:35:09,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-30 10:35:09,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-30 10:35:09,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=2414, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 10:35:09,287 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2018-09-30 10:35:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:10,642 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-30 10:35:10,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 10:35:10,642 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2018-09-30 10:35:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:10,643 INFO L225 Difference]: With dead ends: 155 [2018-09-30 10:35:10,643 INFO L226 Difference]: Without dead ends: 154 [2018-09-30 10:35:10,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2575 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2821, Invalid=5551, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 10:35:10,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-30 10:35:10,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-09-30 10:35:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-30 10:35:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-30 10:35:10,672 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-09-30 10:35:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:10,673 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-30 10:35:10,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-30 10:35:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-30 10:35:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-30 10:35:10,674 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:10,674 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2018-09-30 10:35:10,674 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:10,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:10,674 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2018-09-30 10:35:10,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:10,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:10,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:10,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:10,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:11,472 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:11,472 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:11,481 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:35:11,639 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-30 10:35:11,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:11,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:11,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:11,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:11,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:11,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:12,688 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:12,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-30 10:35:12,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-30 10:35:12,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-30 10:35:12,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1460, Invalid=2572, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 10:35:12,690 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2018-09-30 10:35:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:13,981 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-30 10:35:13,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 10:35:13,982 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2018-09-30 10:35:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:13,983 INFO L225 Difference]: With dead ends: 160 [2018-09-30 10:35:13,983 INFO L226 Difference]: Without dead ends: 159 [2018-09-30 10:35:13,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3008, Invalid=5922, Unknown=0, NotChecked=0, Total=8930 [2018-09-30 10:35:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-30 10:35:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-09-30 10:35:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-30 10:35:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-09-30 10:35:14,008 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-09-30 10:35:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:14,008 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-09-30 10:35:14,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-30 10:35:14,008 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-09-30 10:35:14,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-30 10:35:14,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:14,009 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2018-09-30 10:35:14,009 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:14,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:14,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2018-09-30 10:35:14,010 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:14,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:14,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:14,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:14,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:14,963 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:14,963 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:14,971 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:35:15,136 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-30 10:35:15,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:15,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:15,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:15,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:15,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:15,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:15,915 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:15,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-30 10:35:15,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-30 10:35:15,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-30 10:35:15,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1555, Invalid=2735, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 10:35:15,917 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2018-09-30 10:35:17,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:17,596 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-30 10:35:17,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 10:35:17,596 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2018-09-30 10:35:17,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:17,597 INFO L225 Difference]: With dead ends: 165 [2018-09-30 10:35:17,597 INFO L226 Difference]: Without dead ends: 164 [2018-09-30 10:35:17,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2939 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3201, Invalid=6305, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 10:35:17,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-30 10:35:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-09-30 10:35:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-30 10:35:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-30 10:35:17,628 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-09-30 10:35:17,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:17,629 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-30 10:35:17,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-30 10:35:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-30 10:35:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-30 10:35:17,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:17,630 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2018-09-30 10:35:17,631 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:17,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:17,631 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2018-09-30 10:35:17,631 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:17,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:17,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:17,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:17,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:18,447 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:18,447 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:18,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:18,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:18,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:18,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:18,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:18,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:19,410 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:19,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-30 10:35:19,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 10:35:19,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 10:35:19,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=2903, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 10:35:19,412 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2018-09-30 10:35:20,102 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:35:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:21,127 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-30 10:35:21,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 10:35:21,127 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2018-09-30 10:35:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:21,129 INFO L225 Difference]: With dead ends: 170 [2018-09-30 10:35:21,129 INFO L226 Difference]: Without dead ends: 169 [2018-09-30 10:35:21,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3130 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3400, Invalid=6700, Unknown=0, NotChecked=0, Total=10100 [2018-09-30 10:35:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-30 10:35:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-09-30 10:35:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-30 10:35:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-09-30 10:35:21,154 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-09-30 10:35:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:21,154 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-09-30 10:35:21,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 10:35:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-09-30 10:35:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-30 10:35:21,155 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:21,155 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2018-09-30 10:35:21,155 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:21,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2018-09-30 10:35:21,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:21,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:21,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:22,135 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:22,135 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:22,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:35:22,249 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:35:22,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:22,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:22,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:22,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:22,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:22,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:23,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:23,151 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-30 10:35:23,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-30 10:35:23,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-30 10:35:23,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1754, Invalid=3076, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 10:35:23,153 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2018-09-30 10:35:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:24,798 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-30 10:35:24,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 10:35:24,798 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2018-09-30 10:35:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:24,799 INFO L225 Difference]: With dead ends: 175 [2018-09-30 10:35:24,799 INFO L226 Difference]: Without dead ends: 174 [2018-09-30 10:35:24,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3327 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3605, Invalid=7107, Unknown=0, NotChecked=0, Total=10712 [2018-09-30 10:35:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-30 10:35:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-09-30 10:35:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-30 10:35:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-30 10:35:24,833 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-09-30 10:35:24,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:24,834 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-30 10:35:24,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-30 10:35:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-30 10:35:24,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-30 10:35:24,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:24,835 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2018-09-30 10:35:24,835 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:24,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:24,836 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2018-09-30 10:35:24,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:24,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:24,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:24,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:24,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:26,031 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:26,031 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:26,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:35:26,226 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-30 10:35:26,226 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:26,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:26,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:26,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:26,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:26,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:27,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:27,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-30 10:35:27,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-30 10:35:27,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-30 10:35:27,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=3254, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 10:35:27,437 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2018-09-30 10:35:28,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:28,986 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-30 10:35:28,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 10:35:28,987 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2018-09-30 10:35:28,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:28,988 INFO L225 Difference]: With dead ends: 180 [2018-09-30 10:35:28,988 INFO L226 Difference]: Without dead ends: 179 [2018-09-30 10:35:28,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3530 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3816, Invalid=7526, Unknown=0, NotChecked=0, Total=11342 [2018-09-30 10:35:28,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-30 10:35:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-09-30 10:35:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-30 10:35:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-30 10:35:29,015 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-09-30 10:35:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:29,015 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-30 10:35:29,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-30 10:35:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-30 10:35:29,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-30 10:35:29,017 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:29,017 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2018-09-30 10:35:29,017 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:29,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:29,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2018-09-30 10:35:29,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:29,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:29,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:29,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:29,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:30,266 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:30,266 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:30,273 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:35:30,388 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:35:30,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:30,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:30,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:30,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:30,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:30,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:31,434 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:31,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-30 10:35:31,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-30 10:35:31,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-30 10:35:31,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1965, Invalid=3437, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 10:35:31,436 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2018-09-30 10:35:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:33,719 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-30 10:35:33,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 10:35:33,719 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2018-09-30 10:35:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:33,721 INFO L225 Difference]: With dead ends: 185 [2018-09-30 10:35:33,721 INFO L226 Difference]: Without dead ends: 184 [2018-09-30 10:35:33,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4033, Invalid=7957, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 10:35:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-30 10:35:33,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-09-30 10:35:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-30 10:35:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-30 10:35:33,752 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-09-30 10:35:33,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:33,752 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-30 10:35:33,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-30 10:35:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-30 10:35:33,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-30 10:35:33,753 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:33,753 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2018-09-30 10:35:33,754 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:33,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:33,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2018-09-30 10:35:33,754 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:33,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:33,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:33,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:33,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:34,649 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:34,649 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:34,656 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:35:34,830 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-30 10:35:34,830 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:34,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:34,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:34,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:34,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:34,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:35,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:35,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-30 10:35:35,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-30 10:35:35,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-30 10:35:35,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2075, Invalid=3625, Unknown=0, NotChecked=0, Total=5700 [2018-09-30 10:35:35,953 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2018-09-30 10:35:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:37,816 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-09-30 10:35:37,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 10:35:37,816 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2018-09-30 10:35:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:37,818 INFO L225 Difference]: With dead ends: 190 [2018-09-30 10:35:37,818 INFO L226 Difference]: Without dead ends: 189 [2018-09-30 10:35:37,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3954 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4256, Invalid=8400, Unknown=0, NotChecked=0, Total=12656 [2018-09-30 10:35:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-30 10:35:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-09-30 10:35:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-30 10:35:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-09-30 10:35:37,857 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-09-30 10:35:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:37,858 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-09-30 10:35:37,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-30 10:35:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-09-30 10:35:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-30 10:35:37,859 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:37,859 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2018-09-30 10:35:37,859 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:37,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2018-09-30 10:35:37,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:37,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:37,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:38,821 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:38,821 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:38,828 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:35:39,041 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-30 10:35:39,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:39,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:39,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:39,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:39,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:39,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:41,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:41,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-30 10:35:41,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-30 10:35:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-30 10:35:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2188, Invalid=3818, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 10:35:41,079 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2018-09-30 10:35:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:42,960 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-30 10:35:42,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 10:35:42,961 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2018-09-30 10:35:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:42,962 INFO L225 Difference]: With dead ends: 195 [2018-09-30 10:35:42,962 INFO L226 Difference]: Without dead ends: 194 [2018-09-30 10:35:42,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4175 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4485, Invalid=8855, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 10:35:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-30 10:35:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-09-30 10:35:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-30 10:35:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-30 10:35:42,992 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-09-30 10:35:42,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:42,993 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-30 10:35:42,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-30 10:35:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-30 10:35:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-30 10:35:42,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:42,994 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2018-09-30 10:35:42,994 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:42,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2018-09-30 10:35:42,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:42,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:42,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:42,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:42,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:44,005 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:44,005 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:44,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:44,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:44,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:44,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:44,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:44,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:45,234 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:45,235 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-30 10:35:45,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-30 10:35:45,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-30 10:35:45,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2304, Invalid=4016, Unknown=0, NotChecked=0, Total=6320 [2018-09-30 10:35:45,236 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2018-09-30 10:35:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:47,069 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-30 10:35:47,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 10:35:47,069 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2018-09-30 10:35:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:47,070 INFO L225 Difference]: With dead ends: 200 [2018-09-30 10:35:47,070 INFO L226 Difference]: Without dead ends: 199 [2018-09-30 10:35:47,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4720, Invalid=9322, Unknown=0, NotChecked=0, Total=14042 [2018-09-30 10:35:47,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-30 10:35:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-09-30 10:35:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-30 10:35:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-09-30 10:35:47,102 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-09-30 10:35:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:47,102 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-09-30 10:35:47,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-30 10:35:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-09-30 10:35:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-30 10:35:47,103 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:47,103 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2018-09-30 10:35:47,103 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:47,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:47,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2018-09-30 10:35:47,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:47,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:47,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:47,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:47,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:48,995 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:48,995 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-09-30 10:35:49,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:49,136 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:35:49,136 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:49,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:49,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:49,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:49,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:49,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:50,348 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:50,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-30 10:35:50,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-30 10:35:50,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-30 10:35:50,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2423, Invalid=4219, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 10:35:50,350 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2018-09-30 10:35:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:52,276 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-30 10:35:52,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 10:35:52,277 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2018-09-30 10:35:52,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:52,278 INFO L225 Difference]: With dead ends: 205 [2018-09-30 10:35:52,278 INFO L226 Difference]: Without dead ends: 204 [2018-09-30 10:35:52,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4635 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4961, Invalid=9801, Unknown=0, NotChecked=0, Total=14762 [2018-09-30 10:35:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-30 10:35:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-09-30 10:35:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-30 10:35:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-30 10:35:52,310 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-09-30 10:35:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:52,310 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-30 10:35:52,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-30 10:35:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-30 10:35:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-30 10:35:52,311 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:52,311 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2018-09-30 10:35:52,312 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:52,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:52,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2018-09-30 10:35:52,312 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:52,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:52,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:52,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:52,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:53,813 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:53,813 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:53,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:35:54,101 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-30 10:35:54,101 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:54,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:54,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:54,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:54,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:54,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:55,256 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:55,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-30 10:35:55,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-30 10:35:55,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-30 10:35:55,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2545, Invalid=4427, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 10:35:55,258 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2018-09-30 10:35:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:57,214 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-09-30 10:35:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 10:35:57,214 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2018-09-30 10:35:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:57,215 INFO L225 Difference]: With dead ends: 210 [2018-09-30 10:35:57,215 INFO L226 Difference]: Without dead ends: 209 [2018-09-30 10:35:57,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4874 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5208, Invalid=10292, Unknown=0, NotChecked=0, Total=15500 [2018-09-30 10:35:57,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-30 10:35:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-09-30 10:35:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-30 10:35:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-09-30 10:35:57,254 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-09-30 10:35:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:57,254 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-09-30 10:35:57,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-30 10:35:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-09-30 10:35:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-30 10:35:57,255 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:57,255 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2018-09-30 10:35:57,256 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:35:57,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2018-09-30 10:35:57,256 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:57,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:57,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:57,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:57,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:35:58,670 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:58,670 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:58,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:35:58,818 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:35:58,818 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:58,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:58,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:35:58,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:58,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:35:58,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:00,037 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:00,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-30 10:36:00,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-30 10:36:00,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-30 10:36:00,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2670, Invalid=4640, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 10:36:00,040 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2018-09-30 10:36:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:02,042 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-30 10:36:02,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 10:36:02,042 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2018-09-30 10:36:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:02,043 INFO L225 Difference]: With dead ends: 215 [2018-09-30 10:36:02,043 INFO L226 Difference]: Without dead ends: 214 [2018-09-30 10:36:02,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5119 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5461, Invalid=10795, Unknown=0, NotChecked=0, Total=16256 [2018-09-30 10:36:02,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-30 10:36:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-09-30 10:36:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-30 10:36:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-09-30 10:36:02,081 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-09-30 10:36:02,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:02,081 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-09-30 10:36:02,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-30 10:36:02,082 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-09-30 10:36:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-30 10:36:02,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:02,083 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2018-09-30 10:36:02,083 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:02,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:02,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2018-09-30 10:36:02,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:02,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:02,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:02,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:02,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:03,561 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:03,561 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:36:03,569 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:36:03,948 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-30 10:36:03,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:03,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:03,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:03,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:03,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:36:03,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:05,298 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:05,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-30 10:36:05,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-30 10:36:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-30 10:36:05,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2798, Invalid=4858, Unknown=0, NotChecked=0, Total=7656 [2018-09-30 10:36:05,300 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2018-09-30 10:36:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:07,399 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-09-30 10:36:07,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-30 10:36:07,400 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2018-09-30 10:36:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:07,401 INFO L225 Difference]: With dead ends: 220 [2018-09-30 10:36:07,401 INFO L226 Difference]: Without dead ends: 219 [2018-09-30 10:36:07,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5370 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5720, Invalid=11310, Unknown=0, NotChecked=0, Total=17030 [2018-09-30 10:36:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-30 10:36:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-09-30 10:36:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-30 10:36:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-09-30 10:36:07,438 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-09-30 10:36:07,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:07,438 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-09-30 10:36:07,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-30 10:36:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-09-30 10:36:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-30 10:36:07,439 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:07,439 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2018-09-30 10:36:07,439 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:07,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:07,439 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2018-09-30 10:36:07,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:07,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:07,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:07,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:07,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:08,898 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:08,898 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:36:08,905 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:36:09,174 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-30 10:36:09,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:09,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:09,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:09,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:09,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:36:09,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:10,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:10,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-30 10:36:10,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-30 10:36:10,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-30 10:36:10,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=5081, Unknown=0, NotChecked=0, Total=8010 [2018-09-30 10:36:10,486 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2018-09-30 10:36:10,848 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:36:11,293 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:36:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:13,434 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-09-30 10:36:13,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 10:36:13,435 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2018-09-30 10:36:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:13,436 INFO L225 Difference]: With dead ends: 225 [2018-09-30 10:36:13,436 INFO L226 Difference]: Without dead ends: 224 [2018-09-30 10:36:13,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5627 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5985, Invalid=11837, Unknown=0, NotChecked=0, Total=17822 [2018-09-30 10:36:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-30 10:36:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-09-30 10:36:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-30 10:36:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-30 10:36:13,475 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-09-30 10:36:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:13,476 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-30 10:36:13,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-30 10:36:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-30 10:36:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-30 10:36:13,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:13,477 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2018-09-30 10:36:13,477 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:13,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:13,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2018-09-30 10:36:13,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:13,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:13,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:13,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:13,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:14,829 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:14,829 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:36:14,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:36:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:14,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:15,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:15,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:15,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:36:15,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:16,426 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:16,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-30 10:36:16,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-30 10:36:16,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-30 10:36:16,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3063, Invalid=5309, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 10:36:16,428 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2018-09-30 10:36:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:18,896 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-09-30 10:36:18,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 10:36:18,897 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2018-09-30 10:36:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:18,898 INFO L225 Difference]: With dead ends: 230 [2018-09-30 10:36:18,898 INFO L226 Difference]: Without dead ends: 229 [2018-09-30 10:36:18,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5890 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6256, Invalid=12376, Unknown=0, NotChecked=0, Total=18632 [2018-09-30 10:36:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-30 10:36:18,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-09-30 10:36:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-30 10:36:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-09-30 10:36:18,949 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-09-30 10:36:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:18,949 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-09-30 10:36:18,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-30 10:36:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-09-30 10:36:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-30 10:36:18,950 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:18,950 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2018-09-30 10:36:18,950 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:18,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2018-09-30 10:36:18,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:18,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:18,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:18,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:36:18,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:20,229 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:20,229 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-09-30 10:36:20,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:36:20,381 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:36:20,382 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:20,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:20,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:20,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:20,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:36:20,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:21,998 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:21,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-30 10:36:21,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-30 10:36:21,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-30 10:36:22,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3200, Invalid=5542, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 10:36:22,000 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2018-09-30 10:36:24,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:24,608 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-30 10:36:24,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 10:36:24,608 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2018-09-30 10:36:24,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:24,609 INFO L225 Difference]: With dead ends: 235 [2018-09-30 10:36:24,609 INFO L226 Difference]: Without dead ends: 234 [2018-09-30 10:36:24,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6159 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6533, Invalid=12927, Unknown=0, NotChecked=0, Total=19460 [2018-09-30 10:36:24,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-30 10:36:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-09-30 10:36:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-30 10:36:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-09-30 10:36:24,669 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-09-30 10:36:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:24,669 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-09-30 10:36:24,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-30 10:36:24,670 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-09-30 10:36:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-30 10:36:24,671 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:24,671 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2018-09-30 10:36:24,671 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:24,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:24,672 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2018-09-30 10:36:24,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:24,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:24,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:24,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:24,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:26,086 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:26,086 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:36:26,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:36:26,402 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-30 10:36:26,402 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:26,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:26,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:26,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:26,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:36:26,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:28,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:28,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-30 10:36:28,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-30 10:36:28,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-30 10:36:28,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3340, Invalid=5780, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 10:36:28,071 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2018-09-30 10:36:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:30,644 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-09-30 10:36:30,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 10:36:30,644 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2018-09-30 10:36:30,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:30,646 INFO L225 Difference]: With dead ends: 240 [2018-09-30 10:36:30,646 INFO L226 Difference]: Without dead ends: 239 [2018-09-30 10:36:30,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6434 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6816, Invalid=13490, Unknown=0, NotChecked=0, Total=20306 [2018-09-30 10:36:30,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-30 10:36:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-09-30 10:36:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-30 10:36:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-09-30 10:36:30,703 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-09-30 10:36:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:30,704 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-09-30 10:36:30,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-30 10:36:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-09-30 10:36:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-30 10:36:30,705 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:30,705 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2018-09-30 10:36:30,705 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:30,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:30,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2018-09-30 10:36:30,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:30,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:30,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:30,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:30,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:32,053 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:32,053 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:36:32,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:36:32,222 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:36:32,222 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:32,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:32,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:32,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:32,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:36:32,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:34,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:34,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-30 10:36:34,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-30 10:36:34,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-30 10:36:34,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3483, Invalid=6023, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 10:36:34,080 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2018-09-30 10:36:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:36,599 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-09-30 10:36:36,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 10:36:36,609 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2018-09-30 10:36:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:36,610 INFO L225 Difference]: With dead ends: 245 [2018-09-30 10:36:36,610 INFO L226 Difference]: Without dead ends: 244 [2018-09-30 10:36:36,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6715 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7105, Invalid=14065, Unknown=0, NotChecked=0, Total=21170 [2018-09-30 10:36:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-30 10:36:36,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-09-30 10:36:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-30 10:36:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-30 10:36:36,668 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-09-30 10:36:36,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:36,668 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-30 10:36:36,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-30 10:36:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-30 10:36:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-30 10:36:36,669 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:36,669 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2018-09-30 10:36:36,670 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:36,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:36,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2018-09-30 10:36:36,670 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:36,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:36,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:36,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:36,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:38,080 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:38,080 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:36:38,087 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:36:38,383 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-30 10:36:38,383 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:38,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:38,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:38,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:38,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:36:38,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:40,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:40,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-30 10:36:40,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 10:36:40,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 10:36:40,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3629, Invalid=6271, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 10:36:40,286 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2018-09-30 10:36:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:43,008 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-09-30 10:36:43,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 10:36:43,008 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2018-09-30 10:36:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:43,009 INFO L225 Difference]: With dead ends: 250 [2018-09-30 10:36:43,009 INFO L226 Difference]: Without dead ends: 249 [2018-09-30 10:36:43,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7002 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7400, Invalid=14652, Unknown=0, NotChecked=0, Total=22052 [2018-09-30 10:36:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-30 10:36:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-09-30 10:36:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-09-30 10:36:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-09-30 10:36:43,058 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-09-30 10:36:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:43,059 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-09-30 10:36:43,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 10:36:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-09-30 10:36:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-30 10:36:43,060 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:43,060 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2018-09-30 10:36:43,060 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:43,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:43,060 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2018-09-30 10:36:43,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:43,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:43,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:43,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:43,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:44,938 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:44,938 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:36:44,945 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:36:45,279 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-30 10:36:45,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:45,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:45,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:45,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:45,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:36:45,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:47,151 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:47,151 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-30 10:36:47,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-30 10:36:47,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-30 10:36:47,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3778, Invalid=6524, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 10:36:47,153 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2018-09-30 10:36:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:50,174 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-30 10:36:50,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 10:36:50,175 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2018-09-30 10:36:50,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:50,176 INFO L225 Difference]: With dead ends: 255 [2018-09-30 10:36:50,176 INFO L226 Difference]: Without dead ends: 254 [2018-09-30 10:36:50,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7295 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7701, Invalid=15251, Unknown=0, NotChecked=0, Total=22952 [2018-09-30 10:36:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-30 10:36:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-09-30 10:36:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-30 10:36:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-09-30 10:36:50,239 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-09-30 10:36:50,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:50,240 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-09-30 10:36:50,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-30 10:36:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-09-30 10:36:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-30 10:36:50,241 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:50,241 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2018-09-30 10:36:50,242 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:50,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:50,242 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2018-09-30 10:36:50,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:50,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:50,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:50,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:50,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:51,649 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:51,649 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:36:51,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:36:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:51,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:51,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:51,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:51,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:36:51,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:53,681 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:53,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-30 10:36:53,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-30 10:36:53,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-30 10:36:53,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3930, Invalid=6782, Unknown=0, NotChecked=0, Total=10712 [2018-09-30 10:36:53,684 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2018-09-30 10:36:56,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:56,824 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-09-30 10:36:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 10:36:56,824 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2018-09-30 10:36:56,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:56,826 INFO L225 Difference]: With dead ends: 260 [2018-09-30 10:36:56,826 INFO L226 Difference]: Without dead ends: 259 [2018-09-30 10:36:56,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7594 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8008, Invalid=15862, Unknown=0, NotChecked=0, Total=23870 [2018-09-30 10:36:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-30 10:36:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-09-30 10:36:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-09-30 10:36:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-09-30 10:36:56,893 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-09-30 10:36:56,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:56,894 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-09-30 10:36:56,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-30 10:36:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-09-30 10:36:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-30 10:36:56,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:56,896 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2018-09-30 10:36:56,896 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:36:56,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:56,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2018-09-30 10:36:56,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:56,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:56,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:56,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:36:56,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:36:58,614 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:58,614 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:36:58,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:36:58,796 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:36:58,796 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:58,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:58,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:36:58,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:58,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:36:58,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:00,890 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:00,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-30 10:37:00,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-30 10:37:00,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-30 10:37:00,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4085, Invalid=7045, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 10:37:00,892 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2018-09-30 10:37:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:03,678 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-09-30 10:37:03,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 10:37:03,678 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2018-09-30 10:37:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:03,679 INFO L225 Difference]: With dead ends: 265 [2018-09-30 10:37:03,679 INFO L226 Difference]: Without dead ends: 264 [2018-09-30 10:37:03,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7899 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8321, Invalid=16485, Unknown=0, NotChecked=0, Total=24806 [2018-09-30 10:37:03,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-09-30 10:37:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-09-30 10:37:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-30 10:37:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-30 10:37:03,732 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-09-30 10:37:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:03,732 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-30 10:37:03,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-30 10:37:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-30 10:37:03,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-30 10:37:03,733 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:03,733 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2018-09-30 10:37:03,734 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:03,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:03,734 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2018-09-30 10:37:03,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:03,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:03,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:03,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:03,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:05,758 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:05,758 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:37:05,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:37:06,138 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-30 10:37:06,138 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:06,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:06,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:06,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:06,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:37:06,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:07,956 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:07,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-30 10:37:07,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-30 10:37:07,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-30 10:37:07,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4243, Invalid=7313, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 10:37:07,958 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2018-09-30 10:37:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:11,107 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-09-30 10:37:11,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 10:37:11,107 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2018-09-30 10:37:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:11,108 INFO L225 Difference]: With dead ends: 270 [2018-09-30 10:37:11,109 INFO L226 Difference]: Without dead ends: 269 [2018-09-30 10:37:11,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8210 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8640, Invalid=17120, Unknown=0, NotChecked=0, Total=25760 [2018-09-30 10:37:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-30 10:37:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-09-30 10:37:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-09-30 10:37:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-09-30 10:37:11,171 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-09-30 10:37:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:11,172 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-09-30 10:37:11,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-30 10:37:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-09-30 10:37:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-30 10:37:11,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:11,173 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2018-09-30 10:37:11,173 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:11,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:11,173 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2018-09-30 10:37:11,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:11,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:11,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:11,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:11,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:12,857 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:12,857 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:37:12,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:37:13,045 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:37:13,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:13,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:13,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:13,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:13,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:37:13,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:15,227 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:15,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-30 10:37:15,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-30 10:37:15,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-30 10:37:15,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4404, Invalid=7586, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 10:37:15,230 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2018-09-30 10:37:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:18,275 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-30 10:37:18,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 10:37:18,276 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2018-09-30 10:37:18,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:18,277 INFO L225 Difference]: With dead ends: 275 [2018-09-30 10:37:18,277 INFO L226 Difference]: Without dead ends: 274 [2018-09-30 10:37:18,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8527 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8965, Invalid=17767, Unknown=0, NotChecked=0, Total=26732 [2018-09-30 10:37:18,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-30 10:37:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-09-30 10:37:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-30 10:37:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-09-30 10:37:18,335 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2018-09-30 10:37:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:18,335 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-09-30 10:37:18,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-30 10:37:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-09-30 10:37:18,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-30 10:37:18,337 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:18,337 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2018-09-30 10:37:18,337 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:18,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:18,338 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2018-09-30 10:37:18,338 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:18,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:18,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:18,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:18,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:20,343 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:20,344 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:37:20,354 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:37:20,710 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-30 10:37:20,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:20,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:20,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:20,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:20,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:37:20,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:22,734 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:22,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-30 10:37:22,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-30 10:37:22,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-30 10:37:22,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4568, Invalid=7864, Unknown=0, NotChecked=0, Total=12432 [2018-09-30 10:37:22,736 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2018-09-30 10:37:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:26,013 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-09-30 10:37:26,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-30 10:37:26,013 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2018-09-30 10:37:26,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:26,014 INFO L225 Difference]: With dead ends: 280 [2018-09-30 10:37:26,014 INFO L226 Difference]: Without dead ends: 279 [2018-09-30 10:37:26,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8850 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9296, Invalid=18426, Unknown=0, NotChecked=0, Total=27722 [2018-09-30 10:37:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-30 10:37:26,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2018-09-30 10:37:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-09-30 10:37:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-09-30 10:37:26,086 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2018-09-30 10:37:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:26,087 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-09-30 10:37:26,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-30 10:37:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-09-30 10:37:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-09-30 10:37:26,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:26,088 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2018-09-30 10:37:26,089 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:26,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:26,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2018-09-30 10:37:26,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:26,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:26,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:26,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:26,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:27,736 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:27,736 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:37:27,743 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:37:28,137 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-30 10:37:28,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:28,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:28,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:28,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:28,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:37:28,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:30,493 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:30,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-30 10:37:30,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-30 10:37:30,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-30 10:37:30,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4735, Invalid=8147, Unknown=0, NotChecked=0, Total=12882 [2018-09-30 10:37:30,495 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2018-09-30 10:37:33,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:33,811 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-09-30 10:37:33,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 10:37:33,812 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2018-09-30 10:37:33,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:33,813 INFO L225 Difference]: With dead ends: 285 [2018-09-30 10:37:33,813 INFO L226 Difference]: Without dead ends: 284 [2018-09-30 10:37:33,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9633, Invalid=19097, Unknown=0, NotChecked=0, Total=28730 [2018-09-30 10:37:33,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-30 10:37:33,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2018-09-30 10:37:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-30 10:37:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-30 10:37:33,874 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2018-09-30 10:37:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:33,874 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-30 10:37:33,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-30 10:37:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-30 10:37:33,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-30 10:37:33,875 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:33,875 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2018-09-30 10:37:33,876 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:33,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2018-09-30 10:37:33,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:33,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:33,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:33,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:33,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:35,835 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:35,835 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:37:35,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:37:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:36,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:36,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:36,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:36,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:37:36,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:38,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:38,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-30 10:37:38,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-30 10:37:38,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-30 10:37:38,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4905, Invalid=8435, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 10:37:38,135 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2018-09-30 10:37:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:41,672 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-09-30 10:37:41,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-30 10:37:41,672 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2018-09-30 10:37:41,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:41,674 INFO L225 Difference]: With dead ends: 290 [2018-09-30 10:37:41,674 INFO L226 Difference]: Without dead ends: 289 [2018-09-30 10:37:41,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9514 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9976, Invalid=19780, Unknown=0, NotChecked=0, Total=29756 [2018-09-30 10:37:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-30 10:37:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2018-09-30 10:37:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-30 10:37:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-09-30 10:37:41,738 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2018-09-30 10:37:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:41,738 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-09-30 10:37:41,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-30 10:37:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-09-30 10:37:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-30 10:37:41,739 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:41,739 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2018-09-30 10:37:41,739 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:41,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:41,740 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2018-09-30 10:37:41,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:41,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:41,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:37:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:43,514 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:43,514 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:37:43,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:37:43,709 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:37:43,709 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:43,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:43,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:43,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:43,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:37:43,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:46,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:46,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-30 10:37:46,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-30 10:37:46,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-30 10:37:46,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5078, Invalid=8728, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 10:37:46,070 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2018-09-30 10:37:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:49,446 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-30 10:37:49,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-30 10:37:49,446 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2018-09-30 10:37:49,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:49,448 INFO L225 Difference]: With dead ends: 295 [2018-09-30 10:37:49,448 INFO L226 Difference]: Without dead ends: 294 [2018-09-30 10:37:49,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9855 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10325, Invalid=20475, Unknown=0, NotChecked=0, Total=30800 [2018-09-30 10:37:49,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-30 10:37:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2018-09-30 10:37:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-30 10:37:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-09-30 10:37:49,519 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2018-09-30 10:37:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:49,519 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-09-30 10:37:49,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-30 10:37:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-09-30 10:37:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-30 10:37:49,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:49,520 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2018-09-30 10:37:49,521 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:49,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:49,521 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2018-09-30 10:37:49,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:49,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:49,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:49,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:49,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:51,594 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:51,594 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:37:51,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:37:52,044 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-30 10:37:52,045 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:52,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:52,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:37:52,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:52,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:37:52,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:54,313 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:54,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-30 10:37:54,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-30 10:37:54,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-30 10:37:54,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5254, Invalid=9026, Unknown=0, NotChecked=0, Total=14280 [2018-09-30 10:37:54,316 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2018-09-30 10:37:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:58,021 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-09-30 10:37:58,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-30 10:37:58,021 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2018-09-30 10:37:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:58,022 INFO L225 Difference]: With dead ends: 300 [2018-09-30 10:37:58,022 INFO L226 Difference]: Without dead ends: 299 [2018-09-30 10:37:58,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10202 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10680, Invalid=21182, Unknown=0, NotChecked=0, Total=31862 [2018-09-30 10:37:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-30 10:37:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-09-30 10:37:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-30 10:37:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-09-30 10:37:58,095 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2018-09-30 10:37:58,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:58,095 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-09-30 10:37:58,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-30 10:37:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-09-30 10:37:58,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-30 10:37:58,096 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:58,097 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2018-09-30 10:37:58,097 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:37:58,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:58,097 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2018-09-30 10:37:58,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:58,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:58,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:58,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:58,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:37:59,912 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:59,912 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:37:59,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:38:00,125 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:38:00,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:38:00,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:38:00,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:38:00,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:38:00,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:38:00,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:38:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:38:02,550 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:38:02,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-30 10:38:02,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-30 10:38:02,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-30 10:38:02,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5433, Invalid=9329, Unknown=0, NotChecked=0, Total=14762 [2018-09-30 10:38:02,553 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2018-09-30 10:38:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:38:06,245 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-09-30 10:38:06,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-30 10:38:06,245 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2018-09-30 10:38:06,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:38:06,246 INFO L225 Difference]: With dead ends: 305 [2018-09-30 10:38:06,246 INFO L226 Difference]: Without dead ends: 304 [2018-09-30 10:38:06,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10555 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11041, Invalid=21901, Unknown=0, NotChecked=0, Total=32942 [2018-09-30 10:38:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-09-30 10:38:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2018-09-30 10:38:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-30 10:38:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-30 10:38:06,316 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2018-09-30 10:38:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:38:06,316 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-30 10:38:06,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-30 10:38:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-30 10:38:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-30 10:38:06,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:38:06,317 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2018-09-30 10:38:06,318 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 10:38:06,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:38:06,318 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2018-09-30 10:38:06,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:38:06,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:38:06,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:38:06,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:38:06,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:38:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:38:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:38:08,221 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:38:08,221 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:38:08,228 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:38:08,636 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-30 10:38:08,636 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:38:08,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:38:08,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 10:38:08,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:38:08,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:38:08,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:38:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:38:11,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:38:11,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-30 10:38:11,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-30 10:38:11,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-30 10:38:11,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5615, Invalid=9637, Unknown=0, NotChecked=0, Total=15252 [2018-09-30 10:38:11,066 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. Received shutdown request... [2018-09-30 10:38:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 10:38:14,234 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:38:14,239 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:38:14,240 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:38:14 BoogieIcfgContainer [2018-09-30 10:38:14,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:38:14,241 INFO L168 Benchmark]: Toolchain (without parser) took 238296.86 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.5 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 528.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:38:14,242 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:38:14,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:38:14,242 INFO L168 Benchmark]: Boogie Preprocessor took 29.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:38:14,242 INFO L168 Benchmark]: RCFGBuilder took 456.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:38:14,243 INFO L168 Benchmark]: TraceAbstraction took 237734.93 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.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 507.5 MB. Max. memory is 7.1 GB. [2018-09-30 10:38:14,244 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 456.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237734.93 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.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 507.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and FLOYD_HOARE automaton (currently 57 states, 124 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 179 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and FLOYD_HOARE automaton (currently 57 states, 124 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 179 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 2 error locations. TIMEOUT Result, 237.6s OverallTime, 62 OverallIterations, 60 TraceHistogramMax, 100.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 142 SDtfs, 10640 SDslu, 193 SDs, 0 SdLazy, 16530 SolverSat, 5339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12867 GetRequests, 7200 SyntacticMatches, 0 SemanticMatches, 5666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224107 ImplicationChecksByTransitivity, 178.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 61 MinimizatonAttempts, 182 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.5s SsaConstructionTime, 9.4s SatisfiabilityAnalysisTime, 119.5s InterpolantComputationTime, 18307 NumberOfCodeBlocks, 18307 NumberOfCodeBlocksAsserted, 1031 NumberOfCheckSat, 18186 ConstructedInterpolants, 0 QuantifiedInterpolants, 29486531 SizeOfPredicates, 639 NumberOfNonLiveVariables, 39176 ConjunctsInSsa, 6411 ConjunctsInUnsatCore, 121 InterpolantComputations, 3 PerfectInterpolantSequences, 2/356362 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-38-14-252.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-38-14-252.csv Completed graceful shutdown