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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4eac566 [2018-09-23 19:30:55,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:30:55,561 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:30:55,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:30:55,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:30:55,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:30:55,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:30:55,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:30:55,580 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:30:55,581 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:30:55,581 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:30:55,582 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:30:55,583 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:30:55,584 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:30:55,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:30:55,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:30:55,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:30:55,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:30:55,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:30:55,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:30:55,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:30:55,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:30:55,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:30:55,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:30:55,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:30:55,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:30:55,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:30:55,602 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:30:55,603 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:30:55,605 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:30:55,605 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:30:55,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:30:55,606 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:30:55,606 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:30:55,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:30:55,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:30:55,608 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-23 19:30:55,624 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:30:55,625 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:30:55,626 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:30:55,626 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:30:55,627 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:30:55,627 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:30:55,627 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:30:55,627 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:30:55,628 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:30:55,628 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:30:55,628 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:30:55,628 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:30:55,628 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:30:55,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:30:55,629 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:30:55,629 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:30:55,629 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:30:55,629 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:30:55,630 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:30:55,630 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:30:55,630 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:30:55,630 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:30:55,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:30:55,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:30:55,631 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:30:55,631 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:30:55,631 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:30:55,631 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:30:55,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:30:55,632 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:30:55,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:30:55,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:30:55,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:30:55,693 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:30:55,693 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:30:55,694 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2018-09-23 19:30:55,694 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2018-09-23 19:30:55,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:30:55,746 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:30:55,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:30:55,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:30:55,748 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:30:55,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:55" (1/1) ... [2018-09-23 19:30:55,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:55" (1/1) ... [2018-09-23 19:30:55,787 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-23 19:30:55,788 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-23 19:30:55,788 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-23 19:30:55,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:30:55,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:30:55,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:30:55,792 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:30:55,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:55" (1/1) ... [2018-09-23 19:30:55,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:55" (1/1) ... [2018-09-23 19:30:55,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:55" (1/1) ... [2018-09-23 19:30:55,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:55" (1/1) ... [2018-09-23 19:30:55,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:55" (1/1) ... [2018-09-23 19:30:55,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:55" (1/1) ... [2018-09-23 19:30:55,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:55" (1/1) ... [2018-09-23 19:30:55,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:30:55,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:30:55,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:30:55,815 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:30:55,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:55" (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-23 19:30:55,899 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-23 19:30:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-23 19:30:55,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-23 19:30:56,113 INFO L351 CfgBuilder]: Using library mode [2018-09-23 19:30:56,114 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:30:56 BoogieIcfgContainer [2018-09-23 19:30:56,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:30:56,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:30:56,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:30:56,121 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:30:56,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:55" (1/2) ... [2018-09-23 19:30:56,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d48a5e1 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:30:56, skipping insertion in model container [2018-09-23 19:30:56,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:30:56" (2/2) ... [2018-09-23 19:30:56,127 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2018-09-23 19:30:56,139 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:30:56,147 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 19:30:56,190 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:30:56,190 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:30:56,191 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:30:56,191 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:30:56,191 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:30:56,191 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:30:56,191 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:30:56,192 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:30:56,192 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:30:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-23 19:30:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-23 19:30:56,212 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:56,217 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-23 19:30:56,218 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:56,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:56,227 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-09-23 19:30:56,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:56,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:56,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:56,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:56,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:56,755 WARN L178 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-09-23 19:30:56,809 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-23 19:30:56,811 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:30:56,811 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:30:56,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 19:30:56,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 19:30:56,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:30:56,835 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-09-23 19:30:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:56,947 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-23 19:30:56,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 19:30:56,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-09-23 19:30:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:56,960 INFO L225 Difference]: With dead ends: 14 [2018-09-23 19:30:56,960 INFO L226 Difference]: Without dead ends: 7 [2018-09-23 19:30:56,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:30:56,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-23 19:30:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-09-23 19:30:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-23 19:30:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-23 19:30:57,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-09-23 19:30:57,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:57,001 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-23 19:30:57,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 19:30:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-23 19:30:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-23 19:30:57,002 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:57,002 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-23 19:30:57,002 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:57,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:57,003 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-09-23 19:30:57,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:57,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:57,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:57,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:57,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:57,471 WARN L178 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-09-23 19:30:57,667 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-09-23 19:30:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:30:57,702 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:30:57,702 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-23 19:30:57,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:57,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:30:57,805 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 8 treesize of output 7 [2018-09-23 19:30:57,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:30:57,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:30:57,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:30:58,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:30:58,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:30:58,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:30:58,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:30:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:30:58,108 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:30:58,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-09-23 19:30:58,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:30:58,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:30:58,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:30:58,117 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-09-23 19:30:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:58,188 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-23 19:30:58,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-23 19:30:58,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-09-23 19:30:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:58,190 INFO L225 Difference]: With dead ends: 10 [2018-09-23 19:30:58,190 INFO L226 Difference]: Without dead ends: 9 [2018-09-23 19:30:58,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:30:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-23 19:30:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-09-23 19:30:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-23 19:30:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-23 19:30:58,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-09-23 19:30:58,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:58,195 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-23 19:30:58,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:30:58,195 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-23 19:30:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-23 19:30:58,196 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:58,199 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-09-23 19:30:58,199 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:58,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:58,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-09-23 19:30:58,200 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:58,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:58,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:58,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:30:58,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:58,746 WARN L178 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-09-23 19:30:58,884 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-09-23 19:30:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:30:58,911 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:30:58,911 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-23 19:30:58,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:30:58,926 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:30:58,927 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:30:58,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:30:58,936 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 8 treesize of output 7 [2018-09-23 19:30:58,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:30:58,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:30:58,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:30:59,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:30:59,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:30:59,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:30:59,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:30:59,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:30:59,100 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:30:59,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-23 19:30:59,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-23 19:30:59,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-23 19:30:59,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-23 19:30:59,103 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2018-09-23 19:30:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:30:59,172 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-23 19:30:59,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-23 19:30:59,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-09-23 19:30:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:30:59,174 INFO L225 Difference]: With dead ends: 12 [2018-09-23 19:30:59,175 INFO L226 Difference]: Without dead ends: 11 [2018-09-23 19:30:59,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-23 19:30:59,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-23 19:30:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-09-23 19:30:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-23 19:30:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-23 19:30:59,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-09-23 19:30:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:30:59,180 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-23 19:30:59,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-23 19:30:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-23 19:30:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:30:59,180 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:30:59,180 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-09-23 19:30:59,181 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:30:59,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:30:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-09-23 19:30:59,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:30:59,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:30:59,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:59,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:30:59,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:30:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:30:59,498 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-09-23 19:30:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:30:59,663 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:30:59,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 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-23 19:30:59,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:30:59,681 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-23 19:30:59,681 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:30:59,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:30:59,687 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 8 treesize of output 7 [2018-09-23 19:30:59,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:30:59,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:30:59,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:30:59,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:30:59,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:30:59,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:30:59,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:30:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:30:59,978 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:30:59,978 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-09-23 19:30:59,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-23 19:30:59,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-23 19:30:59,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-09-23 19:30:59,980 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2018-09-23 19:31:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:00,070 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-23 19:31:00,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-23 19:31:00,072 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-09-23 19:31:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:00,073 INFO L225 Difference]: With dead ends: 14 [2018-09-23 19:31:00,073 INFO L226 Difference]: Without dead ends: 13 [2018-09-23 19:31:00,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-09-23 19:31:00,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-23 19:31:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-09-23 19:31:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-23 19:31:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-23 19:31:00,078 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-09-23 19:31:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:00,078 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-23 19:31:00,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-23 19:31:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-23 19:31:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-23 19:31:00,079 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:00,079 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-09-23 19:31:00,079 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:00,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:00,080 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-09-23 19:31:00,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:00,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:00,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:00,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:00,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:00,471 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-09-23 19:31:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:00,570 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:00,570 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-23 19:31:00,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:31:00,606 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:31:00,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:00,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:00,628 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 8 treesize of output 7 [2018-09-23 19:31:00,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:00,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:00,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:00,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:00,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:00,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:00,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:00,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:00,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-23 19:31:00,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-23 19:31:00,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-23 19:31:00,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-09-23 19:31:00,887 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2018-09-23 19:31:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:01,026 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-23 19:31:01,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 19:31:01,027 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2018-09-23 19:31:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:01,028 INFO L225 Difference]: With dead ends: 16 [2018-09-23 19:31:01,028 INFO L226 Difference]: Without dead ends: 15 [2018-09-23 19:31:01,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-09-23 19:31:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-23 19:31:01,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-09-23 19:31:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-23 19:31:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-23 19:31:01,033 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-09-23 19:31:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:01,033 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-23 19:31:01,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-23 19:31:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-23 19:31:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-23 19:31:01,034 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:01,034 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-09-23 19:31:01,035 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:01,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:01,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-09-23 19:31:01,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:01,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:01,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:01,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:01,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:01,369 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:01,370 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-23 19:31:01,383 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:31:01,396 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-23 19:31:01,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:01,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:01,423 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 8 treesize of output 7 [2018-09-23 19:31:01,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:01,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:01,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:01,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:01,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:01,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:01,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:01,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:01,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-23 19:31:01,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:31:01,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:31:01,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:31:01,715 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2018-09-23 19:31:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:01,872 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-23 19:31:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-23 19:31:01,873 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2018-09-23 19:31:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:01,874 INFO L225 Difference]: With dead ends: 18 [2018-09-23 19:31:01,875 INFO L226 Difference]: Without dead ends: 17 [2018-09-23 19:31:01,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:31:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-23 19:31:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-09-23 19:31:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-23 19:31:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-23 19:31:01,880 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-09-23 19:31:01,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:01,880 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-23 19:31:01,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:31:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-23 19:31:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-23 19:31:01,881 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:01,882 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-09-23 19:31:01,882 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:01,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:01,882 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-09-23 19:31:01,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:01,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:01,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:01,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:01,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:02,291 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:02,291 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-23 19:31:02,300 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:31:02,317 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-23 19:31:02,317 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:02,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:02,326 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 8 treesize of output 7 [2018-09-23 19:31:02,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:02,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:02,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:02,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:02,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:02,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:02,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:02,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:02,601 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-09-23 19:31:02,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-23 19:31:02,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-23 19:31:02,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:31:02,602 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2018-09-23 19:31:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:02,948 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-23 19:31:02,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:31:02,948 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2018-09-23 19:31:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:02,949 INFO L225 Difference]: With dead ends: 20 [2018-09-23 19:31:02,949 INFO L226 Difference]: Without dead ends: 19 [2018-09-23 19:31:02,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:31:02,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-23 19:31:02,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-09-23 19:31:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-23 19:31:02,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-23 19:31:02,953 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-09-23 19:31:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:02,954 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-23 19:31:02,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-23 19:31:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-23 19:31:02,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-23 19:31:02,955 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:02,955 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-09-23 19:31:02,955 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:02,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:02,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-09-23 19:31:02,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:02,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:02,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:02,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:02,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:03,646 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:03,646 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-23 19:31:03,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:03,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:03,703 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 8 treesize of output 7 [2018-09-23 19:31:03,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:03,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:03,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:04,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:04,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:04,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:04,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:04,249 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:04,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-23 19:31:04,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-23 19:31:04,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-23 19:31:04,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-09-23 19:31:04,250 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2018-09-23 19:31:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:04,682 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-23 19:31:04,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 19:31:04,682 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2018-09-23 19:31:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:04,683 INFO L225 Difference]: With dead ends: 22 [2018-09-23 19:31:04,683 INFO L226 Difference]: Without dead ends: 21 [2018-09-23 19:31:04,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-09-23 19:31:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-23 19:31:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-09-23 19:31:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-23 19:31:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-23 19:31:04,688 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-09-23 19:31:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:04,689 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-23 19:31:04,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-23 19:31:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-23 19:31:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-23 19:31:04,689 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:04,689 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-09-23 19:31:04,690 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:04,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-09-23 19:31:04,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:04,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:04,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:04,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:04,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:05,161 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:05,161 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-23 19:31:05,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:31:05,178 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:31:05,179 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:05,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:05,183 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 8 treesize of output 7 [2018-09-23 19:31:05,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:05,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:05,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:05,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:05,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:05,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:05,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:05,448 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:05,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-09-23 19:31:05,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-23 19:31:05,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-23 19:31:05,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:31:05,450 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2018-09-23 19:31:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:05,822 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-23 19:31:05,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 19:31:05,825 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-09-23 19:31:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:05,826 INFO L225 Difference]: With dead ends: 24 [2018-09-23 19:31:05,826 INFO L226 Difference]: Without dead ends: 23 [2018-09-23 19:31:05,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:31:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-23 19:31:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-09-23 19:31:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-23 19:31:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-23 19:31:05,831 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-09-23 19:31:05,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:05,832 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-23 19:31:05,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-23 19:31:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-23 19:31:05,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-23 19:31:05,832 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:05,833 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-09-23 19:31:05,833 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:05,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:05,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-09-23 19:31:05,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:05,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:05,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:05,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:05,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:06,225 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:06,225 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-23 19:31:06,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:31:06,246 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-23 19:31:06,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:06,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:06,259 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 8 treesize of output 7 [2018-09-23 19:31:06,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:06,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:06,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:06,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:06,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:06,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:06,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:06,584 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:06,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-09-23 19:31:06,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-23 19:31:06,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-23 19:31:06,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-09-23 19:31:06,586 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2018-09-23 19:31:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:06,925 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-23 19:31:06,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 19:31:06,926 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2018-09-23 19:31:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:06,927 INFO L225 Difference]: With dead ends: 26 [2018-09-23 19:31:06,927 INFO L226 Difference]: Without dead ends: 25 [2018-09-23 19:31:06,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-09-23 19:31:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-23 19:31:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-09-23 19:31:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-23 19:31:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-23 19:31:06,934 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-09-23 19:31:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:06,934 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-23 19:31:06,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-23 19:31:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-23 19:31:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-23 19:31:06,935 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:06,935 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-09-23 19:31:06,935 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:06,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:06,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-09-23 19:31:06,936 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:06,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:06,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:06,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:06,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:07,518 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:07,518 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-23 19:31:07,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:31:07,537 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:31:07,537 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:07,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:07,548 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 8 treesize of output 7 [2018-09-23 19:31:07,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:07,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:07,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:07,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:07,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:07,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:07,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:07,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:07,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-09-23 19:31:07,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-23 19:31:07,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-23 19:31:07,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-09-23 19:31:07,908 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2018-09-23 19:31:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:08,250 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-23 19:31:08,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:31:08,250 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-09-23 19:31:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:08,251 INFO L225 Difference]: With dead ends: 28 [2018-09-23 19:31:08,252 INFO L226 Difference]: Without dead ends: 27 [2018-09-23 19:31:08,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-09-23 19:31:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-23 19:31:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-09-23 19:31:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-23 19:31:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-23 19:31:08,258 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-09-23 19:31:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:08,259 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-23 19:31:08,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-23 19:31:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-23 19:31:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-23 19:31:08,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:08,260 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-09-23 19:31:08,260 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:08,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:08,260 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-09-23 19:31:08,260 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:08,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:08,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:08,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:08,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:08,522 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:31:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:08,946 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:08,947 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-23 19:31:08,954 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:31:08,972 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-23 19:31:08,972 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:08,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:08,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 8 treesize of output 7 [2018-09-23 19:31:08,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:08,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:08,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:09,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:09,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:09,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:09,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:09,444 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:09,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-09-23 19:31:09,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-23 19:31:09,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-23 19:31:09,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2018-09-23 19:31:09,445 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2018-09-23 19:31:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:09,992 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-23 19:31:09,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:31:09,993 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2018-09-23 19:31:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:09,994 INFO L225 Difference]: With dead ends: 30 [2018-09-23 19:31:09,994 INFO L226 Difference]: Without dead ends: 29 [2018-09-23 19:31:09,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2018-09-23 19:31:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-23 19:31:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-09-23 19:31:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-23 19:31:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-23 19:31:09,999 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-09-23 19:31:09,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:10,000 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-23 19:31:10,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-23 19:31:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-23 19:31:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-23 19:31:10,001 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:10,001 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-09-23 19:31:10,001 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:10,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:10,001 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-09-23 19:31:10,002 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:10,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:10,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:10,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:10,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:10,649 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:10,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 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-23 19:31:10,660 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:31:10,690 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-23 19:31:10,691 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:10,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:10,697 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 8 treesize of output 7 [2018-09-23 19:31:10,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:10,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:10,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:11,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:11,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:11,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:11,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:11,117 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:11,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-09-23 19:31:11,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-23 19:31:11,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-23 19:31:11,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-09-23 19:31:11,118 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2018-09-23 19:31:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:11,658 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-23 19:31:11,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:31:11,658 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2018-09-23 19:31:11,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:11,659 INFO L225 Difference]: With dead ends: 32 [2018-09-23 19:31:11,659 INFO L226 Difference]: Without dead ends: 31 [2018-09-23 19:31:11,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-09-23 19:31:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-23 19:31:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-09-23 19:31:11,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-23 19:31:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-23 19:31:11,666 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-09-23 19:31:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:11,667 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-23 19:31:11,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-23 19:31:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-23 19:31:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-23 19:31:11,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:11,668 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-09-23 19:31:11,668 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:11,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:11,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-09-23 19:31:11,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:11,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:11,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:11,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:11,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:12,280 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:12,280 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-23 19:31:12,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:12,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:12,302 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 8 treesize of output 7 [2018-09-23 19:31:12,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:12,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:12,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:12,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:12,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:12,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:12,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:12,782 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:12,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-09-23 19:31:12,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-23 19:31:12,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-23 19:31:12,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-09-23 19:31:12,784 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2018-09-23 19:31:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:13,634 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-23 19:31:13,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-23 19:31:13,634 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2018-09-23 19:31:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:13,636 INFO L225 Difference]: With dead ends: 34 [2018-09-23 19:31:13,636 INFO L226 Difference]: Without dead ends: 33 [2018-09-23 19:31:13,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-09-23 19:31:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-23 19:31:13,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-09-23 19:31:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-23 19:31:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-23 19:31:13,643 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-09-23 19:31:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:13,643 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-23 19:31:13,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-23 19:31:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-23 19:31:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-23 19:31:13,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:13,644 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-09-23 19:31:13,645 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:13,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:13,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-09-23 19:31:13,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:13,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:13,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:13,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:13,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:14,289 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:14,289 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-23 19:31:14,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:31:14,316 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:31:14,316 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:14,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:14,327 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 8 treesize of output 7 [2018-09-23 19:31:14,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:14,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:14,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:14,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:14,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:14,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:14,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:14,903 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:14,903 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-09-23 19:31:14,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-23 19:31:14,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-23 19:31:14,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-23 19:31:14,904 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2018-09-23 19:31:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:15,499 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-23 19:31:15,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-23 19:31:15,500 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2018-09-23 19:31:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:15,501 INFO L225 Difference]: With dead ends: 36 [2018-09-23 19:31:15,501 INFO L226 Difference]: Without dead ends: 35 [2018-09-23 19:31:15,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-23 19:31:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-23 19:31:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-09-23 19:31:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-23 19:31:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-23 19:31:15,506 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-09-23 19:31:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:15,506 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-23 19:31:15,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-23 19:31:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-23 19:31:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-23 19:31:15,507 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:15,508 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-09-23 19:31:15,508 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:15,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:15,508 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-09-23 19:31:15,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:15,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:15,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:15,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:15,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:16,069 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:16,069 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-23 19:31:16,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:31:16,095 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-23 19:31:16,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:16,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:16,110 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 8 treesize of output 7 [2018-09-23 19:31:16,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:16,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:16,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:16,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:16,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:16,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:16,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:16,901 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:16,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-09-23 19:31:16,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-23 19:31:16,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-23 19:31:16,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-09-23 19:31:16,902 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2018-09-23 19:31:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:17,625 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-23 19:31:17,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-23 19:31:17,625 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2018-09-23 19:31:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:17,626 INFO L225 Difference]: With dead ends: 38 [2018-09-23 19:31:17,627 INFO L226 Difference]: Without dead ends: 37 [2018-09-23 19:31:17,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-09-23 19:31:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-23 19:31:17,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-09-23 19:31:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-23 19:31:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-23 19:31:17,633 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-09-23 19:31:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:17,633 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-23 19:31:17,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-23 19:31:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-23 19:31:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-23 19:31:17,634 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:17,634 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-09-23 19:31:17,634 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:17,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:17,635 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-09-23 19:31:17,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:17,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:17,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:17,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:17,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:17,864 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:31:18,100 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-23 19:31:18,359 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:31:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:18,931 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:18,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 19:31:18,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:31:18,951 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:31:18,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:18,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:18,956 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 8 treesize of output 7 [2018-09-23 19:31:18,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:18,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:18,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:19,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:19,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:19,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:19,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:19,506 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:19,507 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-09-23 19:31:19,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-23 19:31:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-23 19:31:19,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1386, Unknown=0, NotChecked=0, Total=1482 [2018-09-23 19:31:19,508 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2018-09-23 19:31:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:20,413 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-23 19:31:20,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:31:20,414 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2018-09-23 19:31:20,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:20,415 INFO L225 Difference]: With dead ends: 40 [2018-09-23 19:31:20,415 INFO L226 Difference]: Without dead ends: 39 [2018-09-23 19:31:20,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=96, Invalid=1386, Unknown=0, NotChecked=0, Total=1482 [2018-09-23 19:31:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-23 19:31:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-09-23 19:31:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-23 19:31:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-23 19:31:20,422 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-09-23 19:31:20,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:20,422 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-23 19:31:20,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-23 19:31:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-23 19:31:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-23 19:31:20,423 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:20,424 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-09-23 19:31:20,424 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:20,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:20,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-09-23 19:31:20,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:20,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:20,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:20,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:20,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:20,714 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:31:20,984 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:31:21,270 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:31:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:22,116 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:22,116 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-23 19:31:22,124 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:31:22,146 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-23 19:31:22,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:22,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:22,155 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 8 treesize of output 7 [2018-09-23 19:31:22,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:22,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:22,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:22,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:22,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:22,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:22,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:22,768 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:22,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-09-23 19:31:22,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-23 19:31:22,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-23 19:31:22,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1539, Unknown=0, NotChecked=0, Total=1640 [2018-09-23 19:31:22,770 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2018-09-23 19:31:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:23,542 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-23 19:31:23,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-23 19:31:23,542 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2018-09-23 19:31:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:23,543 INFO L225 Difference]: With dead ends: 42 [2018-09-23 19:31:23,543 INFO L226 Difference]: Without dead ends: 41 [2018-09-23 19:31:23,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=101, Invalid=1539, Unknown=0, NotChecked=0, Total=1640 [2018-09-23 19:31:23,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-23 19:31:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-09-23 19:31:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-23 19:31:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-23 19:31:23,550 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-09-23 19:31:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:23,550 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-23 19:31:23,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-23 19:31:23,551 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-23 19:31:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-23 19:31:23,551 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:23,551 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-09-23 19:31:23,552 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:23,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:23,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-09-23 19:31:23,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:23,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:23,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:23,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:23,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:24,534 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:24,534 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-23 19:31:24,542 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:31:24,564 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-23 19:31:24,565 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:24,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:24,575 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 8 treesize of output 7 [2018-09-23 19:31:24,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:24,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:24,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:25,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:25,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:25,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:25,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:25,772 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:25,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-09-23 19:31:25,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-23 19:31:25,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-23 19:31:25,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2018-09-23 19:31:25,773 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2018-09-23 19:31:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:26,700 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-23 19:31:26,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 19:31:26,700 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2018-09-23 19:31:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:26,701 INFO L225 Difference]: With dead ends: 44 [2018-09-23 19:31:26,701 INFO L226 Difference]: Without dead ends: 43 [2018-09-23 19:31:26,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2018-09-23 19:31:26,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-23 19:31:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-09-23 19:31:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-23 19:31:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-23 19:31:26,705 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-09-23 19:31:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:26,706 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-23 19:31:26,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-23 19:31:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-23 19:31:26,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-23 19:31:26,706 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:26,707 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-09-23 19:31:26,707 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:26,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:26,707 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-09-23 19:31:26,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:26,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:26,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:26,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:26,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:27,476 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:27,476 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:31:27,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:27,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:27,504 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 8 treesize of output 7 [2018-09-23 19:31:27,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:27,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:27,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:28,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:28,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:28,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:28,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:28,462 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:28,462 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-09-23 19:31:28,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-23 19:31:28,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-23 19:31:28,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1869, Unknown=0, NotChecked=0, Total=1980 [2018-09-23 19:31:28,463 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2018-09-23 19:31:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:29,403 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-23 19:31:29,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 19:31:29,403 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2018-09-23 19:31:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:29,404 INFO L225 Difference]: With dead ends: 46 [2018-09-23 19:31:29,404 INFO L226 Difference]: Without dead ends: 45 [2018-09-23 19:31:29,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=1869, Unknown=0, NotChecked=0, Total=1980 [2018-09-23 19:31:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-23 19:31:29,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-09-23 19:31:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-23 19:31:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-23 19:31:29,414 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-09-23 19:31:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:29,414 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-23 19:31:29,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-23 19:31:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-23 19:31:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-23 19:31:29,421 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:29,421 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-09-23 19:31:29,421 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:29,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:29,421 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-09-23 19:31:29,421 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:29,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:29,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:29,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:29,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:29,644 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:31:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:30,457 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:30,457 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-23 19:31:30,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:31:30,480 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:31:30,481 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:30,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:30,490 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 8 treesize of output 7 [2018-09-23 19:31:30,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:30,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:30,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:31,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:31,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:31,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:31,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:31,559 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:31,560 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-09-23 19:31:31,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-23 19:31:31,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-23 19:31:31,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2018-09-23 19:31:31,562 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2018-09-23 19:31:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:32,710 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-23 19:31:32,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-23 19:31:32,710 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2018-09-23 19:31:32,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:32,711 INFO L225 Difference]: With dead ends: 48 [2018-09-23 19:31:32,711 INFO L226 Difference]: Without dead ends: 47 [2018-09-23 19:31:32,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2018-09-23 19:31:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-23 19:31:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-09-23 19:31:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-23 19:31:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-23 19:31:32,719 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-09-23 19:31:32,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:32,719 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-23 19:31:32,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-23 19:31:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-23 19:31:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-23 19:31:32,720 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:32,720 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-09-23 19:31:32,720 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:32,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:32,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-09-23 19:31:32,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:32,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:32,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:32,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:32,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:33,661 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-09-23 19:31:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:33,847 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:33,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-23 19:31:33,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:31:33,884 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-23 19:31:33,884 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:33,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:33,898 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 8 treesize of output 7 [2018-09-23 19:31:33,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:33,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:33,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:34,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:34,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:34,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:34,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:34,987 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:34,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-09-23 19:31:34,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-23 19:31:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-23 19:31:34,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=2231, Unknown=0, NotChecked=0, Total=2352 [2018-09-23 19:31:34,989 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2018-09-23 19:31:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:36,409 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-23 19:31:36,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-23 19:31:36,413 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2018-09-23 19:31:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:36,413 INFO L225 Difference]: With dead ends: 50 [2018-09-23 19:31:36,413 INFO L226 Difference]: Without dead ends: 49 [2018-09-23 19:31:36,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=121, Invalid=2231, Unknown=0, NotChecked=0, Total=2352 [2018-09-23 19:31:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-23 19:31:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-09-23 19:31:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-23 19:31:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-23 19:31:36,419 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-09-23 19:31:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:36,420 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-23 19:31:36,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-23 19:31:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-23 19:31:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-23 19:31:36,421 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:36,421 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-09-23 19:31:36,421 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:36,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:36,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-09-23 19:31:36,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:36,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:36,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:36,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:36,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:36,588 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:31:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:37,316 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:37,316 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-23 19:31:37,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:31:37,341 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:31:37,341 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:37,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:37,363 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 8 treesize of output 7 [2018-09-23 19:31:37,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:37,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:37,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:38,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:38,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:38,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:38,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:38,854 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:38,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-09-23 19:31:38,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-23 19:31:38,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-23 19:31:38,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2424, Unknown=0, NotChecked=0, Total=2550 [2018-09-23 19:31:38,856 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2018-09-23 19:31:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:40,344 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-23 19:31:40,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-23 19:31:40,344 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2018-09-23 19:31:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:40,345 INFO L225 Difference]: With dead ends: 52 [2018-09-23 19:31:40,345 INFO L226 Difference]: Without dead ends: 51 [2018-09-23 19:31:40,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=126, Invalid=2424, Unknown=0, NotChecked=0, Total=2550 [2018-09-23 19:31:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-23 19:31:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-09-23 19:31:40,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-23 19:31:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-23 19:31:40,351 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-09-23 19:31:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:40,352 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-23 19:31:40,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-23 19:31:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-23 19:31:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-23 19:31:40,353 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:40,353 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-09-23 19:31:40,353 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:40,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:40,353 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-09-23 19:31:40,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:40,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:40,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:40,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:40,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:40,533 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-23 19:31:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:41,437 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:41,437 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-23 19:31:41,445 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:31:41,467 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-23 19:31:41,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:41,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:41,473 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 8 treesize of output 7 [2018-09-23 19:31:41,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:41,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:41,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:42,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:42,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:42,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:42,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:42,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:42,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-09-23 19:31:42,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-23 19:31:42,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-23 19:31:42,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2625, Unknown=0, NotChecked=0, Total=2756 [2018-09-23 19:31:42,476 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2018-09-23 19:31:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:43,663 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-23 19:31:43,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-23 19:31:43,667 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2018-09-23 19:31:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:43,667 INFO L225 Difference]: With dead ends: 54 [2018-09-23 19:31:43,667 INFO L226 Difference]: Without dead ends: 53 [2018-09-23 19:31:43,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=131, Invalid=2625, Unknown=0, NotChecked=0, Total=2756 [2018-09-23 19:31:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-23 19:31:43,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-09-23 19:31:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-23 19:31:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-23 19:31:43,672 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-09-23 19:31:43,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:43,672 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-23 19:31:43,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-23 19:31:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-23 19:31:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-23 19:31:43,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:43,673 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-09-23 19:31:43,673 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:43,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:43,674 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-09-23 19:31:43,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:43,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:43,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:43,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:43,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:43,919 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:31:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:44,813 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:44,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 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-23 19:31:44,820 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:31:44,850 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-23 19:31:44,851 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:44,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:44,855 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 8 treesize of output 7 [2018-09-23 19:31:44,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:44,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:44,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:46,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:46,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:46,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:46,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:46,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:46,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-09-23 19:31:46,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-23 19:31:46,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-23 19:31:46,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2834, Unknown=0, NotChecked=0, Total=2970 [2018-09-23 19:31:46,199 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2018-09-23 19:31:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:47,407 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-23 19:31:47,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-23 19:31:47,408 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2018-09-23 19:31:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:47,408 INFO L225 Difference]: With dead ends: 56 [2018-09-23 19:31:47,408 INFO L226 Difference]: Without dead ends: 55 [2018-09-23 19:31:47,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=136, Invalid=2834, Unknown=0, NotChecked=0, Total=2970 [2018-09-23 19:31:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-23 19:31:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-09-23 19:31:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-23 19:31:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-23 19:31:47,412 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-09-23 19:31:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:47,413 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-23 19:31:47,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-23 19:31:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-23 19:31:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-23 19:31:47,414 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:47,414 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-09-23 19:31:47,414 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:47,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:47,414 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-09-23 19:31:47,414 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:47,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:47,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:47,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:47,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:47,633 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:31:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:48,598 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:48,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 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-23 19:31:48,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:48,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:48,630 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 8 treesize of output 7 [2018-09-23 19:31:48,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:48,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:48,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:49,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:49,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:49,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:49,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:49,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:49,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-09-23 19:31:49,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-23 19:31:49,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-23 19:31:49,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=3051, Unknown=0, NotChecked=0, Total=3192 [2018-09-23 19:31:49,779 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2018-09-23 19:31:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:51,135 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-23 19:31:51,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-23 19:31:51,136 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2018-09-23 19:31:51,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:51,137 INFO L225 Difference]: With dead ends: 58 [2018-09-23 19:31:51,137 INFO L226 Difference]: Without dead ends: 57 [2018-09-23 19:31:51,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=141, Invalid=3051, Unknown=0, NotChecked=0, Total=3192 [2018-09-23 19:31:51,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-23 19:31:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-09-23 19:31:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-23 19:31:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-23 19:31:51,145 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-09-23 19:31:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:51,145 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-23 19:31:51,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-23 19:31:51,145 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-23 19:31:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-23 19:31:51,146 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:51,146 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-09-23 19:31:51,146 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:51,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:51,146 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-09-23 19:31:51,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:51,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:51,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:51,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:51,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:51,364 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:31:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:52,285 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:52,285 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-23 19:31:52,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:31:52,312 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:31:52,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:52,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:52,332 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 8 treesize of output 7 [2018-09-23 19:31:52,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:52,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:52,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:53,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:53,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:53,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:53,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:53,549 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:53,550 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-09-23 19:31:53,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-23 19:31:53,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-23 19:31:53,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=3276, Unknown=0, NotChecked=0, Total=3422 [2018-09-23 19:31:53,551 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2018-09-23 19:31:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:54,808 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-23 19:31:54,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-23 19:31:54,809 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2018-09-23 19:31:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:54,810 INFO L225 Difference]: With dead ends: 60 [2018-09-23 19:31:54,810 INFO L226 Difference]: Without dead ends: 59 [2018-09-23 19:31:54,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=146, Invalid=3276, Unknown=0, NotChecked=0, Total=3422 [2018-09-23 19:31:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-23 19:31:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-09-23 19:31:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-23 19:31:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-23 19:31:54,814 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-09-23 19:31:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:54,814 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-23 19:31:54,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-23 19:31:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-23 19:31:54,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-23 19:31:54,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:54,814 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-09-23 19:31:54,815 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:54,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:54,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-09-23 19:31:54,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:54,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:54,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:54,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:31:54,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:55,086 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:31:55,349 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:31:55,625 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:31:55,965 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:31:56,293 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:31:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:57,335 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:31:57,335 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-23 19:31:57,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:31:57,380 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-23 19:31:57,380 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:31:57,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:31:57,385 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 8 treesize of output 7 [2018-09-23 19:31:57,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:57,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:57,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:31:58,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:31:58,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:31:58,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:31:58,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:31:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:58,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:31:58,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-09-23 19:31:58,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-23 19:31:58,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-23 19:31:58,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=3509, Unknown=0, NotChecked=0, Total=3660 [2018-09-23 19:31:58,706 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2018-09-23 19:32:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:00,109 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-23 19:32:00,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-23 19:32:00,109 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2018-09-23 19:32:00,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:00,110 INFO L225 Difference]: With dead ends: 62 [2018-09-23 19:32:00,110 INFO L226 Difference]: Without dead ends: 61 [2018-09-23 19:32:00,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=151, Invalid=3509, Unknown=0, NotChecked=0, Total=3660 [2018-09-23 19:32:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-23 19:32:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-09-23 19:32:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-23 19:32:00,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-23 19:32:00,116 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-09-23 19:32:00,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:00,116 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-23 19:32:00,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-23 19:32:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-23 19:32:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-23 19:32:00,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:00,117 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-09-23 19:32:00,117 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:00,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-09-23 19:32:00,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:00,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:00,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:32:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:01,456 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:01,456 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-23 19:32:01,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:32:01,486 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:32:01,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:32:01,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:01,493 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 8 treesize of output 7 [2018-09-23 19:32:01,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:01,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:01,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:32:02,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:32:02,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:02,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:02,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:32:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:02,921 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:02,921 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-09-23 19:32:02,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-23 19:32:02,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-23 19:32:02,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=3750, Unknown=0, NotChecked=0, Total=3906 [2018-09-23 19:32:02,922 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2018-09-23 19:32:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:04,690 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-23 19:32:04,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-23 19:32:04,691 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2018-09-23 19:32:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:04,691 INFO L225 Difference]: With dead ends: 64 [2018-09-23 19:32:04,692 INFO L226 Difference]: Without dead ends: 63 [2018-09-23 19:32:04,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=156, Invalid=3750, Unknown=0, NotChecked=0, Total=3906 [2018-09-23 19:32:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-23 19:32:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-09-23 19:32:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-23 19:32:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-23 19:32:04,697 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-09-23 19:32:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:04,697 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-23 19:32:04,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-23 19:32:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-23 19:32:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-23 19:32:04,698 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:04,698 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-09-23 19:32:04,698 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:04,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:04,699 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-09-23 19:32:04,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:04,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:04,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:04,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:32:04,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:05,830 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:05,830 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-23 19:32:05,838 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:32:05,870 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-23 19:32:05,870 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:32:05,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:05,875 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 8 treesize of output 7 [2018-09-23 19:32:05,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:05,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:05,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:32:07,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:32:07,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:07,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:07,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:32:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:07,627 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:07,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-09-23 19:32:07,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-23 19:32:07,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-23 19:32:07,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=3999, Unknown=0, NotChecked=0, Total=4160 [2018-09-23 19:32:07,629 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2018-09-23 19:32:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:09,961 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-23 19:32:09,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-23 19:32:09,962 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2018-09-23 19:32:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:09,963 INFO L225 Difference]: With dead ends: 66 [2018-09-23 19:32:09,963 INFO L226 Difference]: Without dead ends: 65 [2018-09-23 19:32:09,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=161, Invalid=3999, Unknown=0, NotChecked=0, Total=4160 [2018-09-23 19:32:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-23 19:32:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-09-23 19:32:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-23 19:32:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-23 19:32:09,969 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-09-23 19:32:09,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:09,969 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-23 19:32:09,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-23 19:32:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-23 19:32:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-23 19:32:09,970 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:09,970 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-09-23 19:32:09,970 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:09,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-09-23 19:32:09,971 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:09,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:09,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:09,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:32:09,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:10,244 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:32:10,464 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:32:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:11,856 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:11,856 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-23 19:32:11,865 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:32:11,912 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-23 19:32:11,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:32:11,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:11,918 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 8 treesize of output 7 [2018-09-23 19:32:11,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:11,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:11,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:32:13,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:32:13,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:13,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:13,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:32:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:13,460 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:13,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-09-23 19:32:13,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-23 19:32:13,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-23 19:32:13,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=4256, Unknown=0, NotChecked=0, Total=4422 [2018-09-23 19:32:13,461 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2018-09-23 19:32:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:15,168 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-23 19:32:15,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-23 19:32:15,168 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2018-09-23 19:32:15,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:15,169 INFO L225 Difference]: With dead ends: 68 [2018-09-23 19:32:15,170 INFO L226 Difference]: Without dead ends: 67 [2018-09-23 19:32:15,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=166, Invalid=4256, Unknown=0, NotChecked=0, Total=4422 [2018-09-23 19:32:15,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-23 19:32:15,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-09-23 19:32:15,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-23 19:32:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-23 19:32:15,176 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-09-23 19:32:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:15,176 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-23 19:32:15,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-23 19:32:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-23 19:32:15,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-23 19:32:15,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:15,177 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-09-23 19:32:15,177 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:15,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-09-23 19:32:15,178 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:15,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:15,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:15,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:32:15,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:16,563 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:16,563 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-23 19:32:16,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:16,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:16,593 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 8 treesize of output 7 [2018-09-23 19:32:16,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:16,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:16,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:32:18,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:32:18,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:18,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:18,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:32:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:18,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:18,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-09-23 19:32:18,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-23 19:32:18,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-23 19:32:18,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=4521, Unknown=0, NotChecked=0, Total=4692 [2018-09-23 19:32:18,339 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2018-09-23 19:32:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:20,939 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-23 19:32:20,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-23 19:32:20,939 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2018-09-23 19:32:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:20,940 INFO L225 Difference]: With dead ends: 70 [2018-09-23 19:32:20,940 INFO L226 Difference]: Without dead ends: 69 [2018-09-23 19:32:20,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=171, Invalid=4521, Unknown=0, NotChecked=0, Total=4692 [2018-09-23 19:32:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-23 19:32:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-09-23 19:32:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-23 19:32:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-23 19:32:20,948 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-09-23 19:32:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:20,949 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-23 19:32:20,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-23 19:32:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-23 19:32:20,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-23 19:32:20,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:20,949 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-09-23 19:32:20,950 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:20,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:20,950 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-09-23 19:32:20,950 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:20,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:20,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:20,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:20,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:21,150 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:32:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:22,577 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:22,577 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-23 19:32:22,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:32:22,607 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:32:22,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:32:22,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:22,612 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 8 treesize of output 7 [2018-09-23 19:32:22,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:22,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:22,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:32:25,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:32:25,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:25,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:25,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:32:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:25,655 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:25,655 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-09-23 19:32:25,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-23 19:32:25,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-23 19:32:25,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=4794, Unknown=0, NotChecked=0, Total=4970 [2018-09-23 19:32:25,656 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2018-09-23 19:32:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:28,071 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-23 19:32:28,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-23 19:32:28,071 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2018-09-23 19:32:28,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:28,072 INFO L225 Difference]: With dead ends: 72 [2018-09-23 19:32:28,072 INFO L226 Difference]: Without dead ends: 71 [2018-09-23 19:32:28,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=176, Invalid=4794, Unknown=0, NotChecked=0, Total=4970 [2018-09-23 19:32:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-23 19:32:28,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-09-23 19:32:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-23 19:32:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-23 19:32:28,077 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-09-23 19:32:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:28,078 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-23 19:32:28,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-23 19:32:28,078 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-23 19:32:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-23 19:32:28,078 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:28,079 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-09-23 19:32:28,079 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:28,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:28,079 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-09-23 19:32:28,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:28,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:28,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:28,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:32:28,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:29,409 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:29,409 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-23 19:32:29,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:32:29,462 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-23 19:32:29,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:32:29,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:29,474 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 8 treesize of output 7 [2018-09-23 19:32:29,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:29,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:29,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:32:31,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:32:31,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:31,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:31,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:32:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:31,317 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:31,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-09-23 19:32:31,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-23 19:32:31,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-23 19:32:31,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=5075, Unknown=0, NotChecked=0, Total=5256 [2018-09-23 19:32:31,318 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2018-09-23 19:32:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:33,521 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-23 19:32:33,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-23 19:32:33,521 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2018-09-23 19:32:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:33,522 INFO L225 Difference]: With dead ends: 74 [2018-09-23 19:32:33,522 INFO L226 Difference]: Without dead ends: 73 [2018-09-23 19:32:33,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=181, Invalid=5075, Unknown=0, NotChecked=0, Total=5256 [2018-09-23 19:32:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-23 19:32:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-09-23 19:32:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-23 19:32:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-23 19:32:33,527 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-09-23 19:32:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:33,527 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-23 19:32:33,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-23 19:32:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-23 19:32:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-23 19:32:33,528 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:33,528 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-09-23 19:32:33,528 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:33,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:33,529 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-09-23 19:32:33,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:33,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:33,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:33,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:32:33,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:33,745 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:32:33,955 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-23 19:32:34,211 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:32:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:35,528 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:35,528 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-23 19:32:35,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:32:35,557 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:32:35,557 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:32:35,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:35,562 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 8 treesize of output 7 [2018-09-23 19:32:35,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:35,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:35,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:32:37,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:32:37,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:37,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:37,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:32:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:37,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:37,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-09-23 19:32:37,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-23 19:32:37,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-23 19:32:37,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=5364, Unknown=0, NotChecked=0, Total=5550 [2018-09-23 19:32:37,663 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2018-09-23 19:32:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:40,102 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-23 19:32:40,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-23 19:32:40,103 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2018-09-23 19:32:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:40,104 INFO L225 Difference]: With dead ends: 76 [2018-09-23 19:32:40,104 INFO L226 Difference]: Without dead ends: 75 [2018-09-23 19:32:40,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=186, Invalid=5364, Unknown=0, NotChecked=0, Total=5550 [2018-09-23 19:32:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-23 19:32:40,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-09-23 19:32:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-23 19:32:40,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-23 19:32:40,109 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-09-23 19:32:40,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:40,109 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-23 19:32:40,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-23 19:32:40,109 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-23 19:32:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-23 19:32:40,110 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:40,110 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-09-23 19:32:40,110 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:40,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:40,110 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-09-23 19:32:40,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:40,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:40,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:40,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:32:40,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:41,590 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:41,590 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-23 19:32:41,598 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:32:41,712 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-23 19:32:41,712 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:32:41,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:41,717 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 8 treesize of output 7 [2018-09-23 19:32:41,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:41,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:41,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:32:43,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:32:43,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:43,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:43,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:32:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:43,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:43,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-09-23 19:32:43,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-23 19:32:43,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-23 19:32:43,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=5661, Unknown=0, NotChecked=0, Total=5852 [2018-09-23 19:32:43,977 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2018-09-23 19:32:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:46,702 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-23 19:32:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-23 19:32:46,702 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2018-09-23 19:32:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:46,703 INFO L225 Difference]: With dead ends: 78 [2018-09-23 19:32:46,704 INFO L226 Difference]: Without dead ends: 77 [2018-09-23 19:32:46,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=191, Invalid=5661, Unknown=0, NotChecked=0, Total=5852 [2018-09-23 19:32:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-23 19:32:46,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-09-23 19:32:46,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-23 19:32:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-23 19:32:46,708 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-09-23 19:32:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:46,708 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-23 19:32:46,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-23 19:32:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-23 19:32:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-23 19:32:46,709 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:46,709 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-09-23 19:32:46,710 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:46,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:46,710 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-09-23 19:32:46,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:46,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:46,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:46,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:32:46,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:46,987 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:32:47,140 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:32:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:48,631 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:48,631 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-23 19:32:48,639 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:32:48,695 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-23 19:32:48,695 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:32:48,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:48,700 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 8 treesize of output 7 [2018-09-23 19:32:48,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:48,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:48,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:32:50,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:32:50,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:50,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:50,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:32:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:50,855 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:50,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-09-23 19:32:50,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-23 19:32:50,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-23 19:32:50,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=5966, Unknown=0, NotChecked=0, Total=6162 [2018-09-23 19:32:50,856 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2018-09-23 19:32:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:53,487 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-23 19:32:53,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-23 19:32:53,488 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2018-09-23 19:32:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:53,489 INFO L225 Difference]: With dead ends: 80 [2018-09-23 19:32:53,489 INFO L226 Difference]: Without dead ends: 79 [2018-09-23 19:32:53,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=196, Invalid=5966, Unknown=0, NotChecked=0, Total=6162 [2018-09-23 19:32:53,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-23 19:32:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-09-23 19:32:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-23 19:32:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-23 19:32:53,494 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-09-23 19:32:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:53,494 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-23 19:32:53,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-23 19:32:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-23 19:32:53,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-23 19:32:53,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:53,495 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-09-23 19:32:53,495 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:53,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:53,496 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-09-23 19:32:53,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:53,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:53,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:53,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:32:53,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:55,108 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:55,108 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-23 19:32:55,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:55,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:55,142 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 8 treesize of output 7 [2018-09-23 19:32:55,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:55,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:55,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:32:57,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:32:57,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:32:57,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:32:57,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:32:57,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:57,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:57,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-09-23 19:32:57,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-23 19:32:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-23 19:32:57,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=6279, Unknown=0, NotChecked=0, Total=6480 [2018-09-23 19:32:57,654 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2018-09-23 19:33:00,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:00,456 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-23 19:33:00,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-23 19:33:00,457 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2018-09-23 19:33:00,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:00,458 INFO L225 Difference]: With dead ends: 82 [2018-09-23 19:33:00,458 INFO L226 Difference]: Without dead ends: 81 [2018-09-23 19:33:00,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=201, Invalid=6279, Unknown=0, NotChecked=0, Total=6480 [2018-09-23 19:33:00,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-23 19:33:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-09-23 19:33:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-23 19:33:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-23 19:33:00,464 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-09-23 19:33:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:00,464 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-23 19:33:00,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-23 19:33:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-23 19:33:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-23 19:33:00,465 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:00,465 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-09-23 19:33:00,465 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:00,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:00,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-09-23 19:33:00,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:00,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:00,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:00,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:00,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:00,732 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:33:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:02,353 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:02,353 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) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:33:02,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:33:02,384 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:33:02,385 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:33:02,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:02,406 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 8 treesize of output 7 [2018-09-23 19:33:02,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:02,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:02,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:33:04,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:33:04,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:04,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:04,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:33:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:04,983 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:04,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-09-23 19:33:04,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-23 19:33:04,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-23 19:33:04,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=6600, Unknown=0, NotChecked=0, Total=6806 [2018-09-23 19:33:04,985 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2018-09-23 19:33:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:08,561 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-23 19:33:08,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-23 19:33:08,561 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2018-09-23 19:33:08,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:08,562 INFO L225 Difference]: With dead ends: 84 [2018-09-23 19:33:08,563 INFO L226 Difference]: Without dead ends: 83 [2018-09-23 19:33:08,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=206, Invalid=6600, Unknown=0, NotChecked=0, Total=6806 [2018-09-23 19:33:08,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-23 19:33:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-09-23 19:33:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-23 19:33:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-23 19:33:08,568 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-09-23 19:33:08,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:08,568 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-23 19:33:08,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-23 19:33:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-23 19:33:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-23 19:33:08,569 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:08,569 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-09-23 19:33:08,569 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:08,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:08,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-09-23 19:33:08,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:08,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:08,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:08,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:33:08,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:08,834 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:33:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:10,537 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:10,538 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-23 19:33:10,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:33:10,600 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-23 19:33:10,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:33:10,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:10,608 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 8 treesize of output 7 [2018-09-23 19:33:10,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:10,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:10,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:33:13,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:33:13,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:13,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:13,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:33:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:13,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:13,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-09-23 19:33:13,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-23 19:33:13,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-23 19:33:13,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=6929, Unknown=0, NotChecked=0, Total=7140 [2018-09-23 19:33:13,396 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2018-09-23 19:33:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:16,784 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-23 19:33:16,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-23 19:33:16,784 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2018-09-23 19:33:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:16,785 INFO L225 Difference]: With dead ends: 86 [2018-09-23 19:33:16,785 INFO L226 Difference]: Without dead ends: 85 [2018-09-23 19:33:16,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=211, Invalid=6929, Unknown=0, NotChecked=0, Total=7140 [2018-09-23 19:33:16,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-23 19:33:16,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-09-23 19:33:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-23 19:33:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-23 19:33:16,790 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-09-23 19:33:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:16,790 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-23 19:33:16,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-23 19:33:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-23 19:33:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-23 19:33:16,791 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:16,791 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-09-23 19:33:16,791 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:16,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:16,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-09-23 19:33:16,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:16,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:16,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:16,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:33:16,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:18,813 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:18,814 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-23 19:33:18,821 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:33:18,850 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:33:18,850 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:33:18,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:18,855 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 8 treesize of output 7 [2018-09-23 19:33:18,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:18,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:18,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:33:21,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:33:21,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:21,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:21,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:33:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:21,366 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:21,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-09-23 19:33:21,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-23 19:33:21,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-23 19:33:21,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=7266, Unknown=0, NotChecked=0, Total=7482 [2018-09-23 19:33:21,368 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2018-09-23 19:33:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:25,112 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-23 19:33:25,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-23 19:33:25,112 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2018-09-23 19:33:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:25,114 INFO L225 Difference]: With dead ends: 88 [2018-09-23 19:33:25,114 INFO L226 Difference]: Without dead ends: 87 [2018-09-23 19:33:25,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=216, Invalid=7266, Unknown=0, NotChecked=0, Total=7482 [2018-09-23 19:33:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-23 19:33:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-09-23 19:33:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-23 19:33:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-23 19:33:25,119 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-09-23 19:33:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:25,120 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-23 19:33:25,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-23 19:33:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-23 19:33:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-23 19:33:25,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:25,121 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-09-23 19:33:25,121 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:25,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:25,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-09-23 19:33:25,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:25,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:25,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:25,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:33:25,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:25,387 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:33:25,609 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-23 19:33:25,826 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:33:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:27,480 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:27,480 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-23 19:33:27,486 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:33:27,533 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-23 19:33:27,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:33:27,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:27,537 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 8 treesize of output 7 [2018-09-23 19:33:27,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:27,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:27,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:33:30,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:33:30,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:30,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:30,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:33:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:30,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:30,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-09-23 19:33:30,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-23 19:33:30,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-23 19:33:30,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=7611, Unknown=0, NotChecked=0, Total=7832 [2018-09-23 19:33:30,486 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2018-09-23 19:33:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:33,715 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-23 19:33:33,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-23 19:33:33,716 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2018-09-23 19:33:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:33,717 INFO L225 Difference]: With dead ends: 90 [2018-09-23 19:33:33,717 INFO L226 Difference]: Without dead ends: 89 [2018-09-23 19:33:33,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=221, Invalid=7611, Unknown=0, NotChecked=0, Total=7832 [2018-09-23 19:33:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-23 19:33:33,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-09-23 19:33:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-23 19:33:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-23 19:33:33,722 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-09-23 19:33:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:33,723 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-23 19:33:33,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-23 19:33:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-23 19:33:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-23 19:33:33,723 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:33,723 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-09-23 19:33:33,723 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:33,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-09-23 19:33:33,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:33,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:33,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:33,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:33:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:33,976 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:33:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:35,774 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:35,775 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-23 19:33:35,783 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:33:35,846 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-23 19:33:35,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:33:35,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:35,871 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 8 treesize of output 7 [2018-09-23 19:33:35,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:35,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:35,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:33:38,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:33:38,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:38,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:38,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:33:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:38,887 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:38,887 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-09-23 19:33:38,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-23 19:33:38,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-23 19:33:38,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7964, Unknown=0, NotChecked=0, Total=8190 [2018-09-23 19:33:38,888 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2018-09-23 19:33:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:43,354 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-23 19:33:43,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-23 19:33:43,354 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2018-09-23 19:33:43,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:43,355 INFO L225 Difference]: With dead ends: 92 [2018-09-23 19:33:43,355 INFO L226 Difference]: Without dead ends: 91 [2018-09-23 19:33:43,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=226, Invalid=7964, Unknown=0, NotChecked=0, Total=8190 [2018-09-23 19:33:43,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-23 19:33:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-09-23 19:33:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-23 19:33:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-23 19:33:43,360 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-09-23 19:33:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:43,361 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-23 19:33:43,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-23 19:33:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-23 19:33:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-23 19:33:43,361 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:43,361 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-09-23 19:33:43,361 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:43,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:43,362 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-09-23 19:33:43,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:43,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:43,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:43,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:33:43,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:45,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:45,417 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:45,417 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-23 19:33:45,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:45,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:45,456 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 8 treesize of output 7 [2018-09-23 19:33:45,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:45,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:45,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:33:48,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:33:48,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:48,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:48,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:33:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:48,406 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:48,407 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-09-23 19:33:48,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-23 19:33:48,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-23 19:33:48,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=8325, Unknown=0, NotChecked=0, Total=8556 [2018-09-23 19:33:48,409 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2018-09-23 19:33:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:53,276 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-23 19:33:53,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-23 19:33:53,277 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2018-09-23 19:33:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:53,278 INFO L225 Difference]: With dead ends: 94 [2018-09-23 19:33:53,278 INFO L226 Difference]: Without dead ends: 93 [2018-09-23 19:33:53,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=231, Invalid=8325, Unknown=0, NotChecked=0, Total=8556 [2018-09-23 19:33:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-23 19:33:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-09-23 19:33:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-23 19:33:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-23 19:33:53,283 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-09-23 19:33:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:53,283 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-23 19:33:53,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-23 19:33:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-23 19:33:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-23 19:33:53,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:53,284 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-09-23 19:33:53,284 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:53,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:53,284 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-09-23 19:33:53,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:53,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:53,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:53,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:53,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:53,505 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:33:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:55,666 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:55,666 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) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:33:55,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:33:55,704 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:33:55,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:33:55,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:55,709 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 8 treesize of output 7 [2018-09-23 19:33:55,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:55,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:55,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:33:58,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:33:58,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:33:58,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:33:58,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:33:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:58,851 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:58,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-09-23 19:33:58,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-23 19:33:58,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-23 19:33:58,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=8694, Unknown=0, NotChecked=0, Total=8930 [2018-09-23 19:33:58,852 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2018-09-23 19:34:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:03,776 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-23 19:34:03,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-23 19:34:03,777 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2018-09-23 19:34:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:03,777 INFO L225 Difference]: With dead ends: 96 [2018-09-23 19:34:03,777 INFO L226 Difference]: Without dead ends: 95 [2018-09-23 19:34:03,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=236, Invalid=8694, Unknown=0, NotChecked=0, Total=8930 [2018-09-23 19:34:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-23 19:34:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-09-23 19:34:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-23 19:34:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-23 19:34:03,781 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-09-23 19:34:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:03,781 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-23 19:34:03,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-23 19:34:03,781 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-23 19:34:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-23 19:34:03,781 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:03,782 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-09-23 19:34:03,782 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:03,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:03,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-09-23 19:34:03,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:03,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:03,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:03,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:34:03,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:04,082 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:34:04,318 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:34:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:06,298 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:06,298 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 19:34:06,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:34:06,428 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-23 19:34:06,428 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:34:06,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:06,437 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 8 treesize of output 7 [2018-09-23 19:34:06,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:34:06,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:34:06,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:34:09,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:34:09,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:34:09,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:34:09,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:34:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:09,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:09,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-09-23 19:34:09,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-23 19:34:09,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-23 19:34:09,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=9071, Unknown=0, NotChecked=0, Total=9312 [2018-09-23 19:34:09,952 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2018-09-23 19:34:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:15,377 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-23 19:34:15,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-23 19:34:15,377 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2018-09-23 19:34:15,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:15,378 INFO L225 Difference]: With dead ends: 98 [2018-09-23 19:34:15,378 INFO L226 Difference]: Without dead ends: 97 [2018-09-23 19:34:15,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=241, Invalid=9071, Unknown=0, NotChecked=0, Total=9312 [2018-09-23 19:34:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-23 19:34:15,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-09-23 19:34:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-23 19:34:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-23 19:34:15,383 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-09-23 19:34:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:15,383 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-23 19:34:15,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-23 19:34:15,383 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-23 19:34:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-23 19:34:15,384 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:15,384 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-09-23 19:34:15,384 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:15,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:15,384 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-09-23 19:34:15,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:15,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:15,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:15,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:34:15,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:15,626 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:34:15,849 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-23 19:34:16,106 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:34:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:18,177 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:18,177 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-23 19:34:18,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:34:18,217 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:34:18,217 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:34:18,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:18,223 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 8 treesize of output 7 [2018-09-23 19:34:18,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:34:18,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:34:18,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:34:21,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:34:21,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:34:21,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:34:21,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:34:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:21,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:21,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-09-23 19:34:21,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-23 19:34:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-23 19:34:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=9456, Unknown=0, NotChecked=0, Total=9702 [2018-09-23 19:34:21,765 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2018-09-23 19:34:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:26,353 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-23 19:34:26,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-23 19:34:26,353 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2018-09-23 19:34:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:26,354 INFO L225 Difference]: With dead ends: 100 [2018-09-23 19:34:26,355 INFO L226 Difference]: Without dead ends: 99 [2018-09-23 19:34:26,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=246, Invalid=9456, Unknown=0, NotChecked=0, Total=9702 [2018-09-23 19:34:26,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-23 19:34:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-09-23 19:34:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-23 19:34:26,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-23 19:34:26,359 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-09-23 19:34:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:26,359 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-23 19:34:26,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-23 19:34:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-23 19:34:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-23 19:34:26,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:26,360 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-09-23 19:34:26,360 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:26,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:26,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-09-23 19:34:26,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:26,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:26,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:26,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:34:26,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:28,522 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:28,522 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-23 19:34:28,529 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:34:28,584 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-23 19:34:28,584 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:34:28,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:28,612 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 8 treesize of output 7 [2018-09-23 19:34:28,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:34:28,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:34:28,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:34:32,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:34:32,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:34:32,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:34:32,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:34:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:32,915 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:32,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-09-23 19:34:32,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-23 19:34:32,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-23 19:34:32,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=9849, Unknown=0, NotChecked=0, Total=10100 [2018-09-23 19:34:32,916 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2018-09-23 19:34:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:36,883 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-23 19:34:36,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-23 19:34:36,884 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2018-09-23 19:34:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:36,885 INFO L225 Difference]: With dead ends: 102 [2018-09-23 19:34:36,885 INFO L226 Difference]: Without dead ends: 101 [2018-09-23 19:34:36,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=251, Invalid=9849, Unknown=0, NotChecked=0, Total=10100 [2018-09-23 19:34:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-23 19:34:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-09-23 19:34:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-23 19:34:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-23 19:34:36,890 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-09-23 19:34:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:36,891 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-23 19:34:36,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-23 19:34:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-23 19:34:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-23 19:34:36,892 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:36,892 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-09-23 19:34:36,892 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:36,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-09-23 19:34:36,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:36,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:36,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:36,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:34:36,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:37,105 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:34:39,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:39,260 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:39,260 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 19:34:39,267 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:34:39,345 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-23 19:34:39,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:34:39,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:39,351 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 8 treesize of output 7 [2018-09-23 19:34:39,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:34:39,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:34:39,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:34:43,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:34:43,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:34:43,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:34:43,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:34:43,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:43,183 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:43,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-09-23 19:34:43,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-23 19:34:43,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-23 19:34:43,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=10250, Unknown=0, NotChecked=0, Total=10506 [2018-09-23 19:34:43,185 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2018-09-23 19:34:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:49,336 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-23 19:34:49,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-23 19:34:49,336 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2018-09-23 19:34:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:49,337 INFO L225 Difference]: With dead ends: 104 [2018-09-23 19:34:49,337 INFO L226 Difference]: Without dead ends: 103 [2018-09-23 19:34:49,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=256, Invalid=10250, Unknown=0, NotChecked=0, Total=10506 [2018-09-23 19:34:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-23 19:34:49,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-09-23 19:34:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-23 19:34:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-23 19:34:49,344 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-09-23 19:34:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:49,344 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-23 19:34:49,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-23 19:34:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-23 19:34:49,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-23 19:34:49,345 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:49,345 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-09-23 19:34:49,345 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:49,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:49,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-09-23 19:34:49,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:49,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:49,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:49,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:34:49,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:51,947 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:51,947 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-23 19:34:51,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:51,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:51,994 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 8 treesize of output 7 [2018-09-23 19:34:51,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:34:52,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:34:52,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-23 19:34:55,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-23 19:34:55,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:34:55,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:34:55,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-23 19:34:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:55,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:55,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-09-23 19:34:55,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-23 19:34:55,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-23 19:34:55,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=10659, Unknown=0, NotChecked=0, Total=10920 [2018-09-23 19:34:55,937 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2018-09-23 19:35:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:35:01,238 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-23 19:35:01,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-23 19:35:01,239 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2018-09-23 19:35:01,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:35:01,240 INFO L225 Difference]: With dead ends: 106 [2018-09-23 19:35:01,240 INFO L226 Difference]: Without dead ends: 105 [2018-09-23 19:35:01,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=261, Invalid=10659, Unknown=0, NotChecked=0, Total=10920 [2018-09-23 19:35:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-23 19:35:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-09-23 19:35:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-23 19:35:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-23 19:35:01,247 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-09-23 19:35:01,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:35:01,247 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-23 19:35:01,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-23 19:35:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-23 19:35:01,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-23 19:35:01,248 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:35:01,248 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-09-23 19:35:01,248 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:35:01,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:35:01,249 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-09-23 19:35:01,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:35:01,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:35:01,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:01,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:35:01,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:35:01,532 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:35:01,770 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 17 Received shutdown request... [2018-09-23 19:35:03,154 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-23 19:35:03,232 WARN L206 ceAbstractionStarter]: Timeout [2018-09-23 19:35:03,232 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:35:03 BoogieIcfgContainer [2018-09-23 19:35:03,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:35:03,233 INFO L168 Benchmark]: Toolchain (without parser) took 247490.12 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 650.6 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -693.0 MB). Peak memory consumption was 177.7 MB. Max. memory is 7.1 GB. [2018-09-23 19:35:03,234 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-23 19:35:03,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.72 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-23 19:35:03,234 INFO L168 Benchmark]: Boogie Preprocessor took 22.99 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-23 19:35:03,235 INFO L168 Benchmark]: RCFGBuilder took 299.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-23 19:35:03,235 INFO L168 Benchmark]: TraceAbstraction took 247117.39 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 650.6 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -714.2 MB). Peak memory consumption was 156.5 MB. Max. memory is 7.1 GB. [2018-09-23 19:35:03,236 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 43.72 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 22.99 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 299.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247117.39 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 650.6 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -714.2 MB). Peak memory consumption was 156.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 104 with TraceHistMax 51, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 41 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 247.0s OverallTime, 51 OverallIterations, 51 TraceHistogramMax, 97.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 128 SDslu, 2 SDs, 0 SdLazy, 136300 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 81.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3922 GetRequests, 1176 SyntacticMatches, 49 SemanticMatches, 2697 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24696 ImplicationChecksByTransitivity, 138.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 50 MinimizatonAttempts, 50 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 143.0s InterpolantComputationTime, 5197 NumberOfCodeBlocks, 5197 NumberOfCodeBlocksAsserted, 731 NumberOfCheckSat, 5098 ConstructedInterpolants, 0 QuantifiedInterpolants, 5742568 SizeOfPredicates, 49 NumberOfNonLiveVariables, 5390 ConjunctsInSsa, 2793 ConjunctsInUnsatCore, 99 InterpolantComputations, 1 PerfectInterpolantSequences, 0/83300 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/divisibilityWithArray.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-35-03-244.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/divisibilityWithArray.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-35-03-244.csv Completed graceful shutdown