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/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:21:52,956 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:21:52,958 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:21:52,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:21:52,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:21:52,971 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:21:52,973 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:21:52,974 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:21:52,976 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:21:52,977 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:21:52,978 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:21:52,978 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:21:52,979 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:21:52,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:21:52,981 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:21:52,982 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:21:52,983 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:21:52,985 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:21:52,987 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:21:52,989 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:21:52,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:21:52,993 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:21:52,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:21:52,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:21:52,998 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:21:52,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:21:53,002 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:21:53,003 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:21:53,004 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:21:53,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:21:53,010 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:21:53,011 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:21:53,011 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:21:53,011 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:21:53,012 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:21:53,015 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:21:53,016 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-26 21:21:53,042 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:21:53,042 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:21:53,043 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:21:53,043 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:21:53,044 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:21:53,044 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:21:53,044 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:21:53,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:21:53,045 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:21:53,045 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:21:53,045 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:21:53,045 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:21:53,046 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:21:53,046 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:21:53,046 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:21:53,046 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:21:53,046 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:21:53,046 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:21:53,047 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:21:53,047 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:21:53,047 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:21:53,047 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:21:53,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:21:53,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:21:53,048 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:21:53,048 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:21:53,048 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:21:53,048 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:21:53,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:21:53,049 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:21:53,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:21:53,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:21:53,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:21:53,124 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:21:53,124 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:21:53,125 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2018-09-26 21:21:53,125 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2018-09-26 21:21:53,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:21:53,197 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:21:53,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:21:53,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:21:53,198 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:21:53,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:21:53" (1/1) ... [2018-09-26 21:21:53,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:21:53" (1/1) ... [2018-09-26 21:21:53,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:21:53,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:21:53,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:21:53,245 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:21:53,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:21:53" (1/1) ... [2018-09-26 21:21:53,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:21:53" (1/1) ... [2018-09-26 21:21:53,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:21:53" (1/1) ... [2018-09-26 21:21:53,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:21:53" (1/1) ... [2018-09-26 21:21:53,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:21:53" (1/1) ... [2018-09-26 21:21:53,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:21:53" (1/1) ... [2018-09-26 21:21:53,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:21:53" (1/1) ... [2018-09-26 21:21:53,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:21:53,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:21:53,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:21:53,270 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:21:53,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:21:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:21:53,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:21:53,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:21:53,671 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:21:53,672 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:21:53 BoogieIcfgContainer [2018-09-26 21:21:53,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:21:53,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:21:53,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:21:53,676 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:21:53,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:21:53" (1/2) ... [2018-09-26 21:21:53,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f11989 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:21:53, skipping insertion in model container [2018-09-26 21:21:53,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:21:53" (2/2) ... [2018-09-26 21:21:53,680 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2018-09-26 21:21:53,691 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:21:53,700 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:21:53,752 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:21:53,753 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:21:53,753 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:21:53,753 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:21:53,753 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:21:53,753 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:21:53,754 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:21:53,754 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:21:53,754 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:21:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-09-26 21:21:53,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 21:21:53,774 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:21:53,775 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 21:21:53,777 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:21:53,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:21:53,783 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-09-26 21:21:53,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:21:53,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:21:53,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:53,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:21:53,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:21:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:21:54,045 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:21:54,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:21:54,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:21:54,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:21:54,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:21:54,074 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2018-09-26 21:21:54,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:21:54,267 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-09-26 21:21:54,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:21:54,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-26 21:21:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:21:54,284 INFO L225 Difference]: With dead ends: 15 [2018-09-26 21:21:54,284 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 21:21:54,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:21:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 21:21:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 21:21:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 21:21:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-26 21:21:54,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-09-26 21:21:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:21:54,324 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-26 21:21:54,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:21:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-26 21:21:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:21:54,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:21:54,325 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:21:54,325 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:21:54,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:21:54,326 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-09-26 21:21:54,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:21:54,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:21:54,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:54,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:21:54,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:21:54,427 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-26 21:21:54,428 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:21:54,428 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:21:54,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:21:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:21:54,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:21:54,492 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-26 21:21:54,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:21:54,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-09-26 21:21:54,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:21:54,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:21:54,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:21:54,531 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-09-26 21:21:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:21:54,778 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-26 21:21:54,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:21:54,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-26 21:21:54,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:21:54,780 INFO L225 Difference]: With dead ends: 13 [2018-09-26 21:21:54,780 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 21:21:54,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-26 21:21:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 21:21:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 21:21:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 21:21:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-26 21:21:54,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-26 21:21:54,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:21:54,790 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-26 21:21:54,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:21:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-26 21:21:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:21:54,792 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:21:54,792 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:21:54,793 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:21:54,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:21:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-09-26 21:21:54,793 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:21:54,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:21:54,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:54,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:21:54,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:21:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:21:55,110 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:21:55,110 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:21:55,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:21:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:21:55,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:21:55,432 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-26 21:21:55,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:21:55,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:21:55,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:21:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:21:55,566 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:21:55,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-26 21:21:55,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:21:55,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:21:55,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:21:55,568 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 10 states. [2018-09-26 21:21:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:21:55,968 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-09-26 21:21:55,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:21:55,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-26 21:21:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:21:55,970 INFO L225 Difference]: With dead ends: 19 [2018-09-26 21:21:55,970 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 21:21:55,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:21:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 21:21:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 21:21:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 21:21:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-26 21:21:55,977 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-26 21:21:55,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:21:55,977 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-26 21:21:55,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:21:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-26 21:21:55,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:21:55,978 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:21:55,978 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 21:21:55,979 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:21:55,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:21:55,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1765270407, now seen corresponding path program 2 times [2018-09-26 21:21:55,980 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:21:55,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:21:55,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:55,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:21:55,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:21:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:21:56,084 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:21:56,085 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:21:56,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:21:56,109 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:21:56,110 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:21:56,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:21:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:21:56,139 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:21:56,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-09-26 21:21:56,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:21:56,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:21:56,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-26 21:21:56,141 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-09-26 21:21:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:21:56,493 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-26 21:21:56,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:21:56,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-09-26 21:21:56,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:21:56,495 INFO L225 Difference]: With dead ends: 17 [2018-09-26 21:21:56,496 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 21:21:56,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:21:56,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 21:21:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 21:21:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 21:21:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-26 21:21:56,502 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-09-26 21:21:56,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:21:56,503 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-26 21:21:56,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:21:56,503 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-26 21:21:56,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:21:56,503 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:21:56,504 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-09-26 21:21:56,504 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:21:56,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:21:56,504 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 3 times [2018-09-26 21:21:56,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:21:56,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:21:56,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:56,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:21:56,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:21:56,681 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-26 21:21:56,682 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:21:56,682 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:21:56,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:21:56,715 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-26 21:21:56,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:21:56,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:21:56,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-26 21:21:56,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:21:56,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:21:56,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:21:56,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-09-26 21:21:56,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:21:56,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:21:56,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-09-26 21:21:56,977 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-26 21:21:56,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:21:56,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-26 21:21:56,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:21:56,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:21:56,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-26 21:21:56,999 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 13 states. [2018-09-26 21:21:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:21:57,511 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-09-26 21:21:57,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:21:57,511 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-09-26 21:21:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:21:57,512 INFO L225 Difference]: With dead ends: 25 [2018-09-26 21:21:57,513 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 21:21:57,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-09-26 21:21:57,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 21:21:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 21:21:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 21:21:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-26 21:21:57,520 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-09-26 21:21:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:21:57,520 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-26 21:21:57,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:21:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-26 21:21:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:21:57,521 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:21:57,521 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2018-09-26 21:21:57,521 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:21:57,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:21:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1096334355, now seen corresponding path program 4 times [2018-09-26 21:21:57,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:21:57,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:21:57,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:57,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:21:57,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:21:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:21:57,726 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:21:57,727 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:21:57,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:21:57,759 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:21:57,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:21:57,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:21:57,799 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-26 21:21:57,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:21:57,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:21:57,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:21:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-26 21:21:57,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:21:57,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-09-26 21:21:57,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:21:57,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:21:57,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:21:57,879 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-09-26 21:21:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:21:58,097 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-09-26 21:21:58,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:21:58,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-26 21:21:58,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:21:58,098 INFO L225 Difference]: With dead ends: 21 [2018-09-26 21:21:58,098 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 21:21:58,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:21:58,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 21:21:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 21:21:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 21:21:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-26 21:21:58,106 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-09-26 21:21:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:21:58,107 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-26 21:21:58,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:21:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-26 21:21:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:21:58,108 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:21:58,108 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-09-26 21:21:58,108 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:21:58,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:21:58,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 5 times [2018-09-26 21:21:58,109 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:21:58,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:21:58,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:58,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:21:58,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:21:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:21:58,281 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:21:58,281 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:21:58,289 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:21:58,308 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-26 21:21:58,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:21:58,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:21:58,513 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-26 21:21:58,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:21:58,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:21:58,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:21:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:21:58,579 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:21:58,579 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-09-26 21:21:58,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:21:58,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:21:58,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:21:58,580 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2018-09-26 21:21:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:21:59,701 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-09-26 21:21:59,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:21:59,702 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-26 21:21:59,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:21:59,703 INFO L225 Difference]: With dead ends: 35 [2018-09-26 21:21:59,703 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 21:21:59,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2018-09-26 21:21:59,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 21:21:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 21:21:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 21:21:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-26 21:21:59,713 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-09-26 21:21:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:21:59,713 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-26 21:21:59,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:21:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-26 21:21:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 21:21:59,714 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:21:59,714 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-09-26 21:21:59,714 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:21:59,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:21:59,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 6 times [2018-09-26 21:21:59,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:21:59,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:21:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:59,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:21:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:21:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:21:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:21:59,947 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:21:59,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:21:59,954 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:21:59,980 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-09-26 21:21:59,980 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:21:59,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:00,210 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-26 21:22:00,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:00,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:00,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:22:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:00,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:00,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-09-26 21:22:00,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 21:22:00,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 21:22:00,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-09-26 21:22:00,285 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 19 states. [2018-09-26 21:22:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:00,936 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-09-26 21:22:00,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:22:00,937 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2018-09-26 21:22:00,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:00,938 INFO L225 Difference]: With dead ends: 37 [2018-09-26 21:22:00,939 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 21:22:00,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-09-26 21:22:00,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 21:22:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 21:22:00,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 21:22:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-26 21:22:00,948 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-09-26 21:22:00,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:00,948 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-26 21:22:00,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 21:22:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-26 21:22:00,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 21:22:00,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:00,949 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2018-09-26 21:22:00,950 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:00,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:00,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1774380245, now seen corresponding path program 7 times [2018-09-26 21:22:00,950 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:00,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:00,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:00,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:00,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:01,076 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:01,076 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:22:01,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:22:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:01,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:01,146 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:01,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-09-26 21:22:01,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:22:01,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:22:01,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:22:01,150 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-09-26 21:22:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:01,482 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-09-26 21:22:01,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:22:01,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-09-26 21:22:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:01,483 INFO L225 Difference]: With dead ends: 29 [2018-09-26 21:22:01,483 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 21:22:01,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:22:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 21:22:01,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 21:22:01,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 21:22:01,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-26 21:22:01,493 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-09-26 21:22:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:01,494 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-26 21:22:01,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:22:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-26 21:22:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 21:22:01,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:01,495 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-09-26 21:22:01,495 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:01,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:01,496 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 8 times [2018-09-26 21:22:01,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:01,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:01,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:22:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:01,775 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:01,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:22:01,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:22:01,826 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:22:01,827 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:01,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:02,383 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-26 21:22:02,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:02,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:02,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:22:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:02,437 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:02,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-09-26 21:22:02,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 21:22:02,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 21:22:02,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:22:02,439 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 22 states. [2018-09-26 21:22:02,757 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-09-26 21:22:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:03,103 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-09-26 21:22:03,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:22:03,103 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-09-26 21:22:03,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:03,104 INFO L225 Difference]: With dead ends: 43 [2018-09-26 21:22:03,105 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 21:22:03,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2018-09-26 21:22:03,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 21:22:03,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 21:22:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 21:22:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-09-26 21:22:03,114 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-09-26 21:22:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:03,114 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-09-26 21:22:03,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 21:22:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-09-26 21:22:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 21:22:03,115 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:03,115 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2018-09-26 21:22:03,116 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:03,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:03,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1980325449, now seen corresponding path program 9 times [2018-09-26 21:22:03,116 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:03,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:03,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:03,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:03,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:03,277 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:03,277 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:22:03,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:22:03,306 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-26 21:22:03,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:03,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:03,382 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-26 21:22:03,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:03,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:03,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:22:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-26 21:22:03,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:03,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-09-26 21:22:03,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:22:03,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:22:03,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:22:03,451 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 16 states. [2018-09-26 21:22:04,060 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-09-26 21:22:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:04,096 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-09-26 21:22:04,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:22:04,096 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-26 21:22:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:04,097 INFO L225 Difference]: With dead ends: 33 [2018-09-26 21:22:04,098 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 21:22:04,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-09-26 21:22:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 21:22:04,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 21:22:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 21:22:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-26 21:22:04,110 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-09-26 21:22:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:04,110 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-26 21:22:04,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:22:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-26 21:22:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:22:04,111 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:04,111 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-09-26 21:22:04,111 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:04,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:04,112 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 10 times [2018-09-26 21:22:04,112 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:04,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:04,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:04,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:04,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:04,546 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:04,546 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:22:04,553 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:22:04,567 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:22:04,568 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:04,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:04,743 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-26 21:22:04,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:04,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:04,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:22:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-26 21:22:04,811 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:04,812 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 23 [2018-09-26 21:22:04,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 21:22:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 21:22:04,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-09-26 21:22:04,813 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 23 states. [2018-09-26 21:22:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:05,538 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-09-26 21:22:05,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 21:22:05,539 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-09-26 21:22:05,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:05,540 INFO L225 Difference]: With dead ends: 53 [2018-09-26 21:22:05,540 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 21:22:05,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 21:22:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 21:22:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 21:22:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 21:22:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-26 21:22:05,552 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-09-26 21:22:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:05,553 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-26 21:22:05,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 21:22:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-26 21:22:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:22:05,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:05,554 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-09-26 21:22:05,554 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:05,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:05,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 11 times [2018-09-26 21:22:05,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:05,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:05,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:05,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:05,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:05,914 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:05,914 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:22:05,921 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:22:05,948 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-09-26 21:22:05,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:05,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:06,355 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-26 21:22:06,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:06,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:06,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:22:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 20 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:06,428 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:06,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-09-26 21:22:06,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 21:22:06,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 21:22:06,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-09-26 21:22:06,430 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2018-09-26 21:22:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:08,139 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-09-26 21:22:08,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 21:22:08,139 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-09-26 21:22:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:08,140 INFO L225 Difference]: With dead ends: 59 [2018-09-26 21:22:08,140 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 21:22:08,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=313, Invalid=2549, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 21:22:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 21:22:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 21:22:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 21:22:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-26 21:22:08,156 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-09-26 21:22:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:08,156 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-26 21:22:08,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 21:22:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-26 21:22:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 21:22:08,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:08,157 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-09-26 21:22:08,158 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:08,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:08,158 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 12 times [2018-09-26 21:22:08,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:08,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:08,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:08,594 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:08,594 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:22:08,603 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:22:08,656 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-09-26 21:22:08,657 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:08,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:08,943 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-26 21:22:08,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:08,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:08,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:22:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:09,002 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:09,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-09-26 21:22:09,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 21:22:09,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 21:22:09,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-09-26 21:22:09,004 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 31 states. [2018-09-26 21:22:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:09,869 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-09-26 21:22:09,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:22:09,869 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-09-26 21:22:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:09,870 INFO L225 Difference]: With dead ends: 61 [2018-09-26 21:22:09,871 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 21:22:09,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=1535, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 21:22:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 21:22:09,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 21:22:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 21:22:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-09-26 21:22:09,886 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-09-26 21:22:09,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:09,887 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-09-26 21:22:09,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 21:22:09,887 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-09-26 21:22:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 21:22:09,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:09,888 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2018-09-26 21:22:09,888 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:09,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:09,888 INFO L82 PathProgramCache]: Analyzing trace with hash 830172837, now seen corresponding path program 13 times [2018-09-26 21:22:09,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:09,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:09,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:09,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:09,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 72 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:10,105 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:10,105 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:22:10,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:22:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:10,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 72 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:10,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:10,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2018-09-26 21:22:10,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:22:10,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:22:10,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-09-26 21:22:10,171 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 13 states. [2018-09-26 21:22:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:10,305 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-09-26 21:22:10,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 21:22:10,305 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-09-26 21:22:10,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:10,306 INFO L225 Difference]: With dead ends: 45 [2018-09-26 21:22:10,306 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 21:22:10,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:22:10,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 21:22:10,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 21:22:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 21:22:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-26 21:22:10,321 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-09-26 21:22:10,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:10,321 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-26 21:22:10,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:22:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-26 21:22:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 21:22:10,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:10,322 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-09-26 21:22:10,323 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:10,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:10,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 14 times [2018-09-26 21:22:10,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:10,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:10,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:22:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:11,209 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:11,209 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:22:11,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:22:11,244 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:22:11,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:11,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:11,600 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-26 21:22:11,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:11,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:11,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:22:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:11,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:11,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2018-09-26 21:22:11,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 21:22:11,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 21:22:11,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 21:22:11,762 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 34 states. [2018-09-26 21:22:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:12,801 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-09-26 21:22:12,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 21:22:12,801 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2018-09-26 21:22:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:12,802 INFO L225 Difference]: With dead ends: 67 [2018-09-26 21:22:12,802 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 21:22:12,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 21:22:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 21:22:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 21:22:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 21:22:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-09-26 21:22:12,819 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-09-26 21:22:12,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:12,819 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-09-26 21:22:12,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 21:22:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-09-26 21:22:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 21:22:12,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:12,820 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2018-09-26 21:22:12,820 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:12,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:12,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2070347801, now seen corresponding path program 15 times [2018-09-26 21:22:12,821 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:12,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:12,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:12,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:12,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 90 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:13,001 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:13,001 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:22:13,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:22:13,044 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-26 21:22:13,045 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:13,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:13,267 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-26 21:22:13,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:13,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:13,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:22:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 21:22:13,322 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:13,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-09-26 21:22:13,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 21:22:13,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 21:22:13,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-09-26 21:22:13,323 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 24 states. [2018-09-26 21:22:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:13,824 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-09-26 21:22:13,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 21:22:13,825 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-26 21:22:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:13,826 INFO L225 Difference]: With dead ends: 49 [2018-09-26 21:22:13,826 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 21:22:13,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=1032, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 21:22:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 21:22:13,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 21:22:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 21:22:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-26 21:22:13,840 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-09-26 21:22:13,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:13,840 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-26 21:22:13,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 21:22:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-26 21:22:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 21:22:13,841 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:13,841 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-09-26 21:22:13,841 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:13,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:13,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 16 times [2018-09-26 21:22:13,842 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:13,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:13,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:13,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:13,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:14,880 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:14,880 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:14,881 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:22:14,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:22:14,924 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:22:14,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:14,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:15,275 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-26 21:22:15,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:15,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:15,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:22:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 21:22:15,341 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:15,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 35 [2018-09-26 21:22:15,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 21:22:15,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 21:22:15,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 21:22:15,342 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 35 states. [2018-09-26 21:22:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:16,482 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-09-26 21:22:16,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 21:22:16,483 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 46 [2018-09-26 21:22:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:16,483 INFO L225 Difference]: With dead ends: 77 [2018-09-26 21:22:16,484 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 21:22:16,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=205, Invalid=2245, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 21:22:16,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 21:22:16,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 21:22:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 21:22:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-26 21:22:16,504 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-09-26 21:22:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:16,504 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-26 21:22:16,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 21:22:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-26 21:22:16,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 21:22:16,505 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:16,506 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-09-26 21:22:16,506 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:16,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:16,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 17 times [2018-09-26 21:22:16,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:16,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:16,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:16,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:16,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:17,027 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:17,027 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-26 21:22:17,034 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:22:17,079 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-26 21:22:17,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:17,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:17,763 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-26 21:22:17,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:17,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:17,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:22:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 72 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:17,842 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:17,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2018-09-26 21:22:17,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 21:22:17,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 21:22:17,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2034, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 21:22:17,844 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 48 states. [2018-09-26 21:22:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:20,160 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-09-26 21:22:20,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 21:22:20,160 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 50 [2018-09-26 21:22:20,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:20,161 INFO L225 Difference]: With dead ends: 83 [2018-09-26 21:22:20,161 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 21:22:20,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=567, Invalid=5439, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 21:22:20,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 21:22:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 21:22:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 21:22:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-26 21:22:20,186 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2018-09-26 21:22:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:20,186 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-26 21:22:20,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 21:22:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-26 21:22:20,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 21:22:20,187 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:20,188 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-09-26 21:22:20,188 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:20,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:20,188 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 18 times [2018-09-26 21:22:20,188 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:20,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:20,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:20,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:20,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:20,681 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:20,681 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-26 21:22:20,689 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:22:20,737 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-26 21:22:20,738 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:20,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:21,252 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-26 21:22:21,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:21,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:21,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:22:21,305 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-09-26 21:22:21,325 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:21,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15] total 41 [2018-09-26 21:22:21,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 21:22:21,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 21:22:21,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 21:22:21,327 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 41 states. [2018-09-26 21:22:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:22,771 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-09-26 21:22:22,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 21:22:22,771 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2018-09-26 21:22:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:22,772 INFO L225 Difference]: With dead ends: 89 [2018-09-26 21:22:22,772 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 21:22:22,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=239, Invalid=3067, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 21:22:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 21:22:22,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 21:22:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 21:22:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-26 21:22:22,798 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-09-26 21:22:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:22,799 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-26 21:22:22,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 21:22:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-26 21:22:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 21:22:22,799 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:22,800 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-09-26 21:22:22,800 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:22,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:22,800 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 19 times [2018-09-26 21:22:22,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:22,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:22,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:24,251 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:24,251 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-26 21:22:24,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:22:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:24,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:25,203 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-26 21:22:25,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:25,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:25,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:22:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:25,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:25,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 45 [2018-09-26 21:22:25,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 21:22:25,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 21:22:25,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 21:22:25,283 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 46 states. [2018-09-26 21:22:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:26,679 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-09-26 21:22:26,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 21:22:26,679 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 58 [2018-09-26 21:22:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:26,680 INFO L225 Difference]: With dead ends: 91 [2018-09-26 21:22:26,681 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 21:22:26,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 21:22:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 21:22:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 21:22:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 21:22:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-09-26 21:22:26,704 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-09-26 21:22:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:26,704 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-09-26 21:22:26,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 21:22:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-09-26 21:22:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 21:22:26,705 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:26,705 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2018-09-26 21:22:26,705 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:26,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:26,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1210122729, now seen corresponding path program 20 times [2018-09-26 21:22:26,705 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:26,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:26,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:26,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:22:26,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:26,932 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:26,932 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-26 21:22:26,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:22:26,972 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:22:26,973 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:26,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:27,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:27,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-09-26 21:22:27,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:22:27,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:22:27,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:22:27,012 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 18 states. [2018-09-26 21:22:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:27,242 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-09-26 21:22:27,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 21:22:27,247 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-09-26 21:22:27,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:27,247 INFO L225 Difference]: With dead ends: 65 [2018-09-26 21:22:27,248 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 21:22:27,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-26 21:22:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 21:22:27,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 21:22:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 21:22:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-26 21:22:27,274 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-09-26 21:22:27,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:27,275 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-26 21:22:27,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:22:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-26 21:22:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 21:22:27,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:27,275 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-09-26 21:22:27,276 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:27,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:27,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 21 times [2018-09-26 21:22:27,276 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:27,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:27,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:27,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:27,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:28,088 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-26 21:22:28,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:28,088 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-26 21:22:28,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:22:28,157 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-09-26 21:22:28,158 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:28,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:28,748 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-26 21:22:28,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:28,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:28,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:22:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-09-26 21:22:28,824 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:28,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17] total 47 [2018-09-26 21:22:28,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 21:22:28,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 21:22:28,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2044, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 21:22:28,825 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 47 states. [2018-09-26 21:22:30,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:30,952 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-09-26 21:22:30,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 21:22:30,952 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 62 [2018-09-26 21:22:30,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:30,953 INFO L225 Difference]: With dead ends: 101 [2018-09-26 21:22:30,953 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 21:22:30,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=273, Invalid=4017, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 21:22:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 21:22:30,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 21:22:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 21:22:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-26 21:22:30,983 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2018-09-26 21:22:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:30,983 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-26 21:22:30,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 21:22:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-26 21:22:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 21:22:30,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:30,984 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-09-26 21:22:30,984 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:30,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:30,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 22 times [2018-09-26 21:22:30,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:30,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:30,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:30,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:30,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:32,071 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:32,071 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-26 21:22:32,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:22:32,104 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:22:32,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:32,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:32,790 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-26 21:22:32,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:32,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:32,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:22:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-09-26 21:22:32,881 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:32,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 18] total 50 [2018-09-26 21:22:32,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 21:22:32,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 21:22:32,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2324, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 21:22:32,883 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 50 states. [2018-09-26 21:22:34,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:34,961 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-09-26 21:22:34,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 21:22:34,962 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-09-26 21:22:34,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:34,962 INFO L225 Difference]: With dead ends: 107 [2018-09-26 21:22:34,962 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 21:22:34,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=290, Invalid=4540, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 21:22:34,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 21:22:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 21:22:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 21:22:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-09-26 21:22:34,985 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-09-26 21:22:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:34,985 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-09-26 21:22:34,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 21:22:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-09-26 21:22:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 21:22:34,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:34,986 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-09-26 21:22:34,986 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:34,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:34,986 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 23 times [2018-09-26 21:22:34,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:34,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:34,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:34,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:34,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:36,020 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:36,020 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-26 21:22:36,027 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:22:36,124 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-09-26 21:22:36,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:36,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:37,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-26 21:22:37,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:37,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:37,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:22:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:37,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:37,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2018-09-26 21:22:37,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 21:22:37,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 21:22:37,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=4119, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 21:22:37,607 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 68 states. [2018-09-26 21:22:40,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:40,943 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-09-26 21:22:40,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 21:22:40,943 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 70 [2018-09-26 21:22:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:40,944 INFO L225 Difference]: With dead ends: 113 [2018-09-26 21:22:40,944 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 21:22:40,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=997, Invalid=10559, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 21:22:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 21:22:40,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 21:22:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 21:22:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-26 21:22:40,970 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2018-09-26 21:22:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:40,970 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-26 21:22:40,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 21:22:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-26 21:22:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 21:22:40,971 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:40,971 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-09-26 21:22:40,971 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:40,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:40,971 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 24 times [2018-09-26 21:22:40,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:40,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:40,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:40,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:40,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:41,827 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:41,827 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-26 21:22:41,835 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:22:41,911 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-09-26 21:22:41,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:41,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:42,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-26 21:22:42,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:42,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:42,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:22:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:42,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:42,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 57 [2018-09-26 21:22:42,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 21:22:42,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 21:22:42,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 21:22:42,908 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 58 states. [2018-09-26 21:22:44,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:44,779 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-09-26 21:22:44,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 21:22:44,779 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 74 [2018-09-26 21:22:44,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:44,780 INFO L225 Difference]: With dead ends: 115 [2018-09-26 21:22:44,780 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 21:22:44,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 21:22:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 21:22:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 21:22:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 21:22:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-26 21:22:44,809 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-09-26 21:22:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:44,809 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-26 21:22:44,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 21:22:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-26 21:22:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 21:22:44,810 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:44,810 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2018-09-26 21:22:44,810 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:44,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:44,811 INFO L82 PathProgramCache]: Analyzing trace with hash -42507335, now seen corresponding path program 25 times [2018-09-26 21:22:44,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:44,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:44,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:44,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:44,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 306 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:45,620 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:45,620 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-26 21:22:45,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:22:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:45,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 306 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:45,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:45,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 21 [2018-09-26 21:22:45,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 21:22:45,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 21:22:45,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:22:45,705 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 22 states. [2018-09-26 21:22:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:46,008 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-09-26 21:22:46,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 21:22:46,008 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 76 [2018-09-26 21:22:46,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:46,009 INFO L225 Difference]: With dead ends: 81 [2018-09-26 21:22:46,009 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 21:22:46,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 21:22:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 21:22:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 21:22:46,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 21:22:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-26 21:22:46,038 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-09-26 21:22:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:46,038 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-26 21:22:46,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 21:22:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-26 21:22:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 21:22:46,039 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:46,039 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-09-26 21:22:46,039 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:46,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:46,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 26 times [2018-09-26 21:22:46,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:46,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:46,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:46,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:22:46,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:47,130 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:47,131 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-26 21:22:47,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:22:47,182 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:22:47,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:47,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:48,246 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-26 21:22:48,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:48,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:48,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:22:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:48,336 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:48,336 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 60 [2018-09-26 21:22:48,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 21:22:48,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 21:22:48,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3482, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 21:22:48,338 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 61 states. [2018-09-26 21:22:50,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:50,645 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-09-26 21:22:50,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 21:22:50,646 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 78 [2018-09-26 21:22:50,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:50,647 INFO L225 Difference]: With dead ends: 121 [2018-09-26 21:22:50,647 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 21:22:50,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=377, Invalid=6265, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 21:22:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 21:22:50,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 21:22:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 21:22:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-09-26 21:22:50,678 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-09-26 21:22:50,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:50,678 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-09-26 21:22:50,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 21:22:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-09-26 21:22:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 21:22:50,678 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:50,678 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2018-09-26 21:22:50,679 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:50,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:50,679 INFO L82 PathProgramCache]: Analyzing trace with hash 752544557, now seen corresponding path program 27 times [2018-09-26 21:22:50,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:50,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:50,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:50,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:50,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 342 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:51,512 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:51,512 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:22:51,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:22:51,608 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-09-26 21:22:51,608 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:51,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:53,440 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-26 21:22:53,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:53,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:53,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:22:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-09-26 21:22:53,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:53,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2018-09-26 21:22:53,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 21:22:53,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 21:22:53,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 21:22:53,514 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 42 states. [2018-09-26 21:22:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:22:54,672 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-09-26 21:22:54,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 21:22:54,672 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-26 21:22:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:22:54,673 INFO L225 Difference]: With dead ends: 85 [2018-09-26 21:22:54,673 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 21:22:54,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=588, Invalid=3318, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 21:22:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 21:22:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 21:22:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 21:22:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-26 21:22:54,706 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-09-26 21:22:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:22:54,706 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-26 21:22:54,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 21:22:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-26 21:22:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 21:22:54,707 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:22:54,707 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-09-26 21:22:54,707 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:22:54,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:22:54,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 28 times [2018-09-26 21:22:54,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:22:54,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:22:54,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:54,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:22:54,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:22:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:22:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:22:55,925 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:22:55,925 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-26 21:22:55,935 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:22:55,964 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:22:55,965 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:22:55,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:22:56,901 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-26 21:22:56,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:22:56,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:22:56,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:22:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-09-26 21:22:56,994 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:22:56,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 22] total 62 [2018-09-26 21:22:56,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 21:22:56,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 21:22:56,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=3624, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 21:22:56,996 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 62 states. [2018-09-26 21:23:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:23:00,089 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-09-26 21:23:00,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 21:23:00,089 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 82 [2018-09-26 21:23:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:23:00,090 INFO L225 Difference]: With dead ends: 131 [2018-09-26 21:23:00,090 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 21:23:00,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=358, Invalid=6952, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 21:23:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 21:23:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 21:23:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 21:23:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-26 21:23:00,138 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2018-09-26 21:23:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:23:00,138 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-26 21:23:00,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 21:23:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-26 21:23:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 21:23:00,139 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:23:00,139 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-09-26 21:23:00,139 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:23:00,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:23:00,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 29 times [2018-09-26 21:23:00,139 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:23:00,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:23:00,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:00,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:23:00,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:23:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:01,433 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:23:01,433 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-26 21:23:01,442 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:23:01,570 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-09-26 21:23:01,570 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:23:01,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:23:03,491 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-26 21:23:03,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:23:03,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:23:03,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:23:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 306 proven. 534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:03,592 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:23:03,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 83 [2018-09-26 21:23:03,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 21:23:03,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 21:23:03,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=6309, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 21:23:03,594 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 84 states. [2018-09-26 21:23:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:23:08,441 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-09-26 21:23:08,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 21:23:08,441 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 86 [2018-09-26 21:23:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:23:08,443 INFO L225 Difference]: With dead ends: 137 [2018-09-26 21:23:08,443 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 21:23:08,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2976 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1431, Invalid=15861, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 21:23:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 21:23:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 21:23:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 21:23:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-26 21:23:08,491 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2018-09-26 21:23:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:23:08,491 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-26 21:23:08,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 21:23:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-26 21:23:08,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 21:23:08,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:23:08,492 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-09-26 21:23:08,492 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:23:08,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:23:08,493 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 30 times [2018-09-26 21:23:08,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:23:08,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:23:08,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:08,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:23:08,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:23:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:09,607 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:23:09,607 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-26 21:23:09,615 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:23:09,718 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-09-26 21:23:09,718 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:23:09,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:23:11,156 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-26 21:23:11,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:23:11,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:23:11,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:23:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:11,258 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:23:11,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 69 [2018-09-26 21:23:11,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 21:23:11,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 21:23:11,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 21:23:11,259 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 70 states. [2018-09-26 21:23:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:23:13,828 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-09-26 21:23:13,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 21:23:13,828 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 90 [2018-09-26 21:23:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:23:13,829 INFO L225 Difference]: With dead ends: 139 [2018-09-26 21:23:13,829 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 21:23:13,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 21:23:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 21:23:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 21:23:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 21:23:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-09-26 21:23:13,879 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-09-26 21:23:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:23:13,879 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-09-26 21:23:13,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 21:23:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-09-26 21:23:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 21:23:13,880 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:23:13,880 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2018-09-26 21:23:13,880 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:23:13,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:23:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1017783689, now seen corresponding path program 31 times [2018-09-26 21:23:13,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:23:13,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:23:13,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:13,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:23:13,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:23:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 462 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:14,350 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:23:14,350 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-26 21:23:14,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:23:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:23:14,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:23:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 462 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:14,446 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:23:14,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 25 [2018-09-26 21:23:14,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 21:23:14,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 21:23:14,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-09-26 21:23:14,448 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 26 states. [2018-09-26 21:23:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:23:14,919 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-09-26 21:23:14,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 21:23:14,919 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-09-26 21:23:14,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:23:14,920 INFO L225 Difference]: With dead ends: 97 [2018-09-26 21:23:14,920 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 21:23:14,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 21:23:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 21:23:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 21:23:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 21:23:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-26 21:23:14,962 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-09-26 21:23:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:23:14,962 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-26 21:23:14,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 21:23:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-26 21:23:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 21:23:14,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:23:14,963 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-09-26 21:23:14,964 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:23:14,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:23:14,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 32 times [2018-09-26 21:23:14,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:23:14,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:23:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:14,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:23:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:23:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:16,464 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:23:16,464 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-26 21:23:16,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:23:16,525 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:23:16,525 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:23:16,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:23:17,861 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-26 21:23:17,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:23:17,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:23:17,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:23:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:17,963 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:23:17,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 72 [2018-09-26 21:23:17,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 21:23:17,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 21:23:17,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=5042, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 21:23:17,965 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 73 states. [2018-09-26 21:23:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:23:20,857 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-09-26 21:23:20,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 21:23:20,857 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 94 [2018-09-26 21:23:20,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:23:20,859 INFO L225 Difference]: With dead ends: 145 [2018-09-26 21:23:20,859 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 21:23:20,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=453, Invalid=9053, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 21:23:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 21:23:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 21:23:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 21:23:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-09-26 21:23:20,903 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-09-26 21:23:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:23:20,904 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-09-26 21:23:20,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 21:23:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-09-26 21:23:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 21:23:20,904 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:23:20,904 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2018-09-26 21:23:20,905 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:23:20,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:23:20,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1867070211, now seen corresponding path program 33 times [2018-09-26 21:23:20,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:23:20,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:23:20,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:20,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:23:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:23:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 506 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:22,335 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:23:22,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 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-26 21:23:22,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:23:22,466 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-09-26 21:23:22,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:23:22,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:23:23,073 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-26 21:23:23,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:23:23,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:23:23,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:23:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-09-26 21:23:23,157 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:23:23,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2018-09-26 21:23:23,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 21:23:23,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 21:23:23,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2076, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 21:23:23,158 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 50 states. [2018-09-26 21:23:24,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:23:24,777 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-09-26 21:23:24,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 21:23:24,777 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-26 21:23:24,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:23:24,778 INFO L225 Difference]: With dead ends: 101 [2018-09-26 21:23:24,778 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 21:23:24,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=800, Invalid=4750, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 21:23:24,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 21:23:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 21:23:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 21:23:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-26 21:23:24,822 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-09-26 21:23:24,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:23:24,822 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-26 21:23:24,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 21:23:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-26 21:23:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 21:23:24,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:23:24,823 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-09-26 21:23:24,823 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:23:24,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:23:24,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 34 times [2018-09-26 21:23:24,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:23:24,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:23:24,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:24,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:23:24,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:23:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 1104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:26,452 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:23:26,453 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-26 21:23:26,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:23:26,499 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:23:26,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:23:26,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:23:27,854 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-26 21:23:27,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:23:27,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:23:27,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:23:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-09-26 21:23:27,958 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:23:27,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 26] total 74 [2018-09-26 21:23:27,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 21:23:27,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 21:23:27,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=5212, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 21:23:27,960 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 74 states. [2018-09-26 21:23:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:23:32,020 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-09-26 21:23:32,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 21:23:32,021 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 98 [2018-09-26 21:23:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:23:32,022 INFO L225 Difference]: With dead ends: 155 [2018-09-26 21:23:32,022 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 21:23:32,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=426, Invalid=9876, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 21:23:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 21:23:32,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 21:23:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 21:23:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-26 21:23:32,069 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2018-09-26 21:23:32,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:23:32,069 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-26 21:23:32,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 21:23:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-26 21:23:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 21:23:32,069 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:23:32,070 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-09-26 21:23:32,070 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:23:32,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:23:32,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 35 times [2018-09-26 21:23:32,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:23:32,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:23:32,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:32,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:23:32,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:23:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:33,598 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:23:33,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 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-26 21:23:33,606 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:23:33,804 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-09-26 21:23:33,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:23:33,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:23:36,653 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-26 21:23:36,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:23:36,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:23:36,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:23:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 462 proven. 738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:36,816 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:23:36,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 99 [2018-09-26 21:23:36,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 21:23:36,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 21:23:36,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=937, Invalid=8963, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 21:23:36,818 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 100 states. [2018-09-26 21:23:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:23:42,865 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-09-26 21:23:42,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 21:23:42,865 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 102 [2018-09-26 21:23:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:23:42,867 INFO L225 Difference]: With dead ends: 161 [2018-09-26 21:23:42,867 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 21:23:42,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4198 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1945, Invalid=22235, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 21:23:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 21:23:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 21:23:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 21:23:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-26 21:23:42,913 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2018-09-26 21:23:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:23:42,914 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-26 21:23:42,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 21:23:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-26 21:23:42,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 21:23:42,915 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:23:42,915 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-09-26 21:23:42,915 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:23:42,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:23:42,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 36 times [2018-09-26 21:23:42,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:23:42,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:23:42,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:42,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:23:42,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:23:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:44,497 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:23:44,497 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-26 21:23:44,504 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:23:44,647 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-09-26 21:23:44,647 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:23:44,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:23:46,299 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-26 21:23:46,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:23:46,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:23:46,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:23:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:46,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:23:46,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 81 [2018-09-26 21:23:46,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 21:23:46,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 21:23:46,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 21:23:46,423 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 82 states. [2018-09-26 21:23:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:23:50,325 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-09-26 21:23:50,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 21:23:50,326 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 106 [2018-09-26 21:23:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:23:50,327 INFO L225 Difference]: With dead ends: 163 [2018-09-26 21:23:50,327 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 21:23:50,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 21:23:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 21:23:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 21:23:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 21:23:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-09-26 21:23:50,381 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-09-26 21:23:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:23:50,381 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-09-26 21:23:50,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 21:23:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-09-26 21:23:50,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 21:23:50,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:23:50,382 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2018-09-26 21:23:50,383 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:23:50,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:23:50,383 INFO L82 PathProgramCache]: Analyzing trace with hash 653870937, now seen corresponding path program 37 times [2018-09-26 21:23:50,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:23:50,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:23:50,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:50,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:23:50,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:23:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 650 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:51,230 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:23:51,230 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-26 21:23:51,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:23:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:23:51,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:23:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 650 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:51,362 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:23:51,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 29 [2018-09-26 21:23:51,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 21:23:51,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 21:23:51,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-09-26 21:23:51,363 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 30 states. [2018-09-26 21:23:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:23:52,158 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-09-26 21:23:52,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 21:23:52,158 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2018-09-26 21:23:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:23:52,159 INFO L225 Difference]: With dead ends: 113 [2018-09-26 21:23:52,159 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 21:23:52,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 21:23:52,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 21:23:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 21:23:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 21:23:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-26 21:23:52,214 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-09-26 21:23:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:23:52,214 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-26 21:23:52,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 21:23:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-26 21:23:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 21:23:52,215 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:23:52,215 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-09-26 21:23:52,215 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:23:52,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:23:52,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 38 times [2018-09-26 21:23:52,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:23:52,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:23:52,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:52,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:23:52,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:23:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:23:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:53,947 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:23:53,948 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-26 21:23:53,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:23:54,020 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:23:54,020 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:23:54,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:23:55,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-26 21:23:55,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:23:55,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:23:55,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:23:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:23:56,060 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:23:56,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 84 [2018-09-26 21:23:56,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 21:23:56,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 21:23:56,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=6890, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 21:23:56,062 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 85 states. [2018-09-26 21:24:00,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:24:00,799 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2018-09-26 21:24:00,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 21:24:00,799 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 110 [2018-09-26 21:24:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:24:00,801 INFO L225 Difference]: With dead ends: 169 [2018-09-26 21:24:00,801 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 21:24:00,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=529, Invalid=12353, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 21:24:00,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 21:24:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 21:24:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 21:24:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-09-26 21:24:00,858 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-09-26 21:24:00,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:24:00,859 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-09-26 21:24:00,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 21:24:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-09-26 21:24:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 21:24:00,859 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:24:00,859 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2018-09-26 21:24:00,860 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:24:00,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:24:00,860 INFO L82 PathProgramCache]: Analyzing trace with hash -738263347, now seen corresponding path program 39 times [2018-09-26 21:24:00,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:24:00,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:24:00,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:00,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:24:00,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:24:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 702 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:24:01,446 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:24:01,446 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-26 21:24:01,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:24:01,632 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-09-26 21:24:01,632 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:24:01,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:24:03,754 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-26 21:24:03,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:24:03,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:24:03,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:24:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-09-26 21:24:03,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:24:03,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-09-26 21:24:03,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 21:24:03,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 21:24:03,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2814, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 21:24:03,849 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 58 states. [2018-09-26 21:24:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:24:05,896 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-09-26 21:24:05,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 21:24:05,897 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-26 21:24:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:24:05,898 INFO L225 Difference]: With dead ends: 117 [2018-09-26 21:24:05,898 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 21:24:05,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1044, Invalid=6438, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 21:24:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 21:24:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 21:24:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 21:24:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-26 21:24:05,962 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-09-26 21:24:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:24:05,962 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-26 21:24:05,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 21:24:05,963 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-26 21:24:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 21:24:05,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:24:05,963 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-09-26 21:24:05,964 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:24:05,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:24:05,964 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 40 times [2018-09-26 21:24:05,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:24:05,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:24:05,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:05,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:24:05,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:24:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:24:08,111 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:24:08,111 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-26 21:24:08,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:24:08,161 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:24:08,161 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:24:08,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:24:10,048 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-26 21:24:10,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:24:10,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:24:10,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:24:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-09-26 21:24:10,167 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:24:10,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 30] total 86 [2018-09-26 21:24:10,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 21:24:10,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 21:24:10,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=7088, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 21:24:10,168 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 86 states. [2018-09-26 21:24:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:24:15,641 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2018-09-26 21:24:15,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 21:24:15,642 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 114 [2018-09-26 21:24:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:24:15,643 INFO L225 Difference]: With dead ends: 179 [2018-09-26 21:24:15,643 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 21:24:15,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=494, Invalid=13312, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 21:24:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 21:24:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 21:24:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 21:24:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-09-26 21:24:15,711 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-09-26 21:24:15,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:24:15,711 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-09-26 21:24:15,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 21:24:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-09-26 21:24:15,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 21:24:15,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:24:15,712 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-09-26 21:24:15,712 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:24:15,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:24:15,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 41 times [2018-09-26 21:24:15,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:24:15,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:24:15,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:15,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:24:15,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:24:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 1624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:24:17,790 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:24:17,790 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:24:17,798 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:24:18,118 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-09-26 21:24:18,118 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:24:18,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:24:21,636 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-26 21:24:21,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:24:21,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:24:21,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:24:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 650 proven. 974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:24:21,768 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:24:21,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 115 [2018-09-26 21:24:21,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 21:24:21,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 21:24:21,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=12081, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 21:24:21,770 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 116 states. [2018-09-26 21:24:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:24:29,867 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-09-26 21:24:29,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 21:24:29,867 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 118 [2018-09-26 21:24:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:24:29,868 INFO L225 Difference]: With dead ends: 185 [2018-09-26 21:24:29,868 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 21:24:29,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5628 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=2539, Invalid=29681, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 21:24:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 21:24:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 21:24:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 21:24:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-26 21:24:29,964 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2018-09-26 21:24:29,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:24:29,965 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-26 21:24:29,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 21:24:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-26 21:24:29,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 21:24:29,966 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:24:29,966 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-09-26 21:24:29,966 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:24:29,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:24:29,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 42 times [2018-09-26 21:24:29,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:24:29,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:24:29,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:29,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:24:29,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:24:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:24:32,149 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:24:32,149 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:24:32,157 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:24:32,391 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2018-09-26 21:24:32,391 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:24:32,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:24:34,734 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-26 21:24:34,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:24:34,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:24:34,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:24:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-09-26 21:24:34,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:24:34,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 32] total 92 [2018-09-26 21:24:34,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 21:24:34,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 21:24:34,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=8134, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 21:24:34,862 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 92 states. [2018-09-26 21:24:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:24:40,846 INFO L93 Difference]: Finished difference Result 191 states and 195 transitions. [2018-09-26 21:24:40,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 21:24:40,846 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 122 [2018-09-26 21:24:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:24:40,847 INFO L225 Difference]: With dead ends: 191 [2018-09-26 21:24:40,847 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 21:24:40,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=528, Invalid=15222, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 21:24:40,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 21:24:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 21:24:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 21:24:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-26 21:24:40,920 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2018-09-26 21:24:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:24:40,920 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-26 21:24:40,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 21:24:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-26 21:24:40,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 21:24:40,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:24:40,921 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-09-26 21:24:40,922 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:24:40,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:24:40,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 43 times [2018-09-26 21:24:40,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:24:40,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:24:40,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:40,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:24:40,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:24:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 1860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:24:43,672 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:24:43,672 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-26 21:24:43,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:24:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:24:43,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:24:45,970 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-26 21:24:45,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:24:45,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:24:45,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:24:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 1860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:24:46,107 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:24:46,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 96 [2018-09-26 21:24:46,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 21:24:46,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 21:24:46,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=9026, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 21:24:46,109 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 97 states. [2018-09-26 21:24:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:24:51,277 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2018-09-26 21:24:51,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 21:24:51,277 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 126 [2018-09-26 21:24:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:24:51,278 INFO L225 Difference]: With dead ends: 193 [2018-09-26 21:24:51,279 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 21:24:51,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=605, Invalid=16165, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 21:24:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 21:24:51,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 21:24:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 21:24:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-09-26 21:24:51,372 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-09-26 21:24:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:24:51,372 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-09-26 21:24:51,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 21:24:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-09-26 21:24:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 21:24:51,373 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:24:51,373 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2018-09-26 21:24:51,373 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:24:51,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:24:51,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2012453021, now seen corresponding path program 44 times [2018-09-26 21:24:51,374 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:24:51,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:24:51,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:51,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:24:51,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:24:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 930 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:24:53,040 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:24:53,040 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-26 21:24:53,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:24:53,114 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:24:53,115 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:24:53,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:24:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 930 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:24:53,180 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:24:53,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 34 [2018-09-26 21:24:53,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 21:24:53,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 21:24:53,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 21:24:53,181 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 35 states. [2018-09-26 21:24:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:24:53,978 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-09-26 21:24:53,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 21:24:53,979 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 128 [2018-09-26 21:24:53,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:24:53,980 INFO L225 Difference]: With dead ends: 133 [2018-09-26 21:24:53,980 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 21:24:53,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 21:24:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 21:24:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 21:24:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 21:24:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-26 21:24:54,054 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-09-26 21:24:54,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:24:54,054 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-26 21:24:54,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 21:24:54,054 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-26 21:24:54,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 21:24:54,055 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:24:54,055 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-09-26 21:24:54,055 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:24:54,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:24:54,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 45 times [2018-09-26 21:24:54,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:24:54,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:24:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:54,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:24:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:24:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:24:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:24:57,004 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:24:57,004 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-26 21:24:57,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:24:57,279 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-09-26 21:24:57,279 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:24:57,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:25:00,178 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-26 21:25:00,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:25:00,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:25:00,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:25:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:00,319 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:25:00,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 99 [2018-09-26 21:25:00,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 21:25:00,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 21:25:00,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 21:25:00,320 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 100 states. [2018-09-26 21:25:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:06,270 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-09-26 21:25:06,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 21:25:06,271 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 130 [2018-09-26 21:25:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:06,272 INFO L225 Difference]: With dead ends: 199 [2018-09-26 21:25:06,272 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 21:25:06,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 21:25:06,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 21:25:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 21:25:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 21:25:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-09-26 21:25:06,346 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-09-26 21:25:06,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:06,346 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-09-26 21:25:06,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 21:25:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-09-26 21:25:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 21:25:06,346 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:06,347 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2018-09-26 21:25:06,347 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:06,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:06,347 INFO L82 PathProgramCache]: Analyzing trace with hash -452907503, now seen corresponding path program 46 times [2018-09-26 21:25:06,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:06,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:06,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:06,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:25:06,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 992 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:07,418 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:25:07,418 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-26 21:25:07,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:25:07,489 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:25:07,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:25:07,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:25:08,809 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-26 21:25:08,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:25:08,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:25:08,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:25:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-09-26 21:25:08,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:25:08,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 68 [2018-09-26 21:25:08,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 21:25:08,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 21:25:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=3894, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 21:25:08,965 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 68 states. [2018-09-26 21:25:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:11,788 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-09-26 21:25:11,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 21:25:11,788 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-26 21:25:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:11,789 INFO L225 Difference]: With dead ends: 137 [2018-09-26 21:25:11,790 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 21:25:11,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2143 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1394, Invalid=8908, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 21:25:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 21:25:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 21:25:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 21:25:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-26 21:25:11,883 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-09-26 21:25:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:11,883 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-26 21:25:11,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 21:25:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-26 21:25:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 21:25:11,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:11,884 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-09-26 21:25:11,884 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:11,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:11,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 47 times [2018-09-26 21:25:11,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:11,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:11,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:11,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:25:11,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 2112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:14,793 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:25:14,793 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-26 21:25:14,800 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:25:15,291 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-09-26 21:25:15,292 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:25:15,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:25:20,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-26 21:25:20,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:25:20,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:25:20,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-26 21:25:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 870 proven. 1242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:20,241 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:25:20,242 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 131 [2018-09-26 21:25:20,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 21:25:20,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 21:25:20,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1629, Invalid=15663, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 21:25:20,243 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 132 states. [2018-09-26 21:25:27,713 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 12 [2018-09-26 21:25:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:30,889 INFO L93 Difference]: Finished difference Result 209 states and 213 transitions. [2018-09-26 21:25:30,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 21:25:30,889 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 134 [2018-09-26 21:25:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:30,890 INFO L225 Difference]: With dead ends: 209 [2018-09-26 21:25:30,891 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 21:25:30,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7266 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=3213, Invalid=38199, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 21:25:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 21:25:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 21:25:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 21:25:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-26 21:25:30,971 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-09-26 21:25:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:30,971 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-26 21:25:30,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 21:25:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-26 21:25:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 21:25:30,972 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:30,972 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-09-26 21:25:30,972 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:30,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:30,972 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 48 times [2018-09-26 21:25:30,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:30,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:30,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:30,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:25:30,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 2244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:33,899 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:25:33,899 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-26 21:25:33,908 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:25:34,222 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-09-26 21:25:34,222 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:25:34,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:25:37,818 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-26 21:25:37,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:25:37,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:25:37,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-26 21:25:37,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 2244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:37,989 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:25:37,989 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 105 [2018-09-26 21:25:37,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 21:25:37,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 21:25:37,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 21:25:37,990 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 106 states. [2018-09-26 21:25:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:44,470 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-09-26 21:25:44,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 21:25:44,470 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 138 [2018-09-26 21:25:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:44,471 INFO L225 Difference]: With dead ends: 211 [2018-09-26 21:25:44,471 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 21:25:44,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2355 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 21:25:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 21:25:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 21:25:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 21:25:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-09-26 21:25:44,555 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-09-26 21:25:44,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:44,556 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-09-26 21:25:44,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 21:25:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-09-26 21:25:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 21:25:44,556 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:44,557 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2018-09-26 21:25:44,557 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:44,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:44,557 INFO L82 PathProgramCache]: Analyzing trace with hash 32287481, now seen corresponding path program 49 times [2018-09-26 21:25:44,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:44,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:44,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:25:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1122 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:46,014 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:25:46,014 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:25:46,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:46,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:25:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1122 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:46,169 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:25:46,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 37 [2018-09-26 21:25:46,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 21:25:46,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 21:25:46,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 21:25:46,172 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 38 states. [2018-09-26 21:25:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:47,004 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-09-26 21:25:47,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 21:25:47,004 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 140 [2018-09-26 21:25:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:47,005 INFO L225 Difference]: With dead ends: 145 [2018-09-26 21:25:47,005 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 21:25:47,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 21:25:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 21:25:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 21:25:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 21:25:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-09-26 21:25:47,093 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-09-26 21:25:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:47,094 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-09-26 21:25:47,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 21:25:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-09-26 21:25:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 21:25:47,095 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:47,095 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-09-26 21:25:47,095 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:47,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:47,095 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 50 times [2018-09-26 21:25:47,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:47,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:47,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:47,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:47,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:50,812 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:25:50,812 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:25:50,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:25:50,899 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:25:50,900 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:25:50,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-09-26 21:25:52,526 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-26 21:25:52,727 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:25:52,728 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:25:52,733 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:25:52,733 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:25:52 BoogieIcfgContainer [2018-09-26 21:25:52,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:25:52,739 INFO L168 Benchmark]: Toolchain (without parser) took 239539.64 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -556.5 MB). Peak memory consumption was 595.4 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:52,739 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:52,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.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-26 21:25:52,740 INFO L168 Benchmark]: Boogie Preprocessor took 24.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:52,740 INFO L168 Benchmark]: RCFGBuilder took 402.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:52,741 INFO L168 Benchmark]: TraceAbstraction took 239060.32 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -577.6 MB). Peak memory consumption was 574.3 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:52,743 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.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 Preprocessor took 24.77 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 402.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239060.32 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -577.6 MB). Peak memory consumption was 574.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 80). Cancelled while BasicCegarLoop was analyzing trace of length 143 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 93 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 238.9s OverallTime, 52 OverallIterations, 35 TraceHistogramMax, 119.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1722 SDtfs, 5023 SDslu, 73288 SDs, 0 SdLazy, 78215 SolverSat, 5532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6567 GetRequests, 3002 SyntacticMatches, 23 SemanticMatches, 3542 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50004 ImplicationChecksByTransitivity, 153.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 51 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 104.3s InterpolantComputationTime, 7282 NumberOfCodeBlocks, 7129 NumberOfCodeBlocksAsserted, 526 NumberOfCheckSat, 7181 ConstructedInterpolants, 0 QuantifiedInterpolants, 3846605 SizeOfPredicates, 290 NumberOfNonLiveVariables, 12240 ConjunctsInSsa, 3618 ConjunctsInUnsatCore, 101 InterpolantComputations, 1 PerfectInterpolantSequences, 18946/79144 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/invert_string.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-25-52-751.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-25-52-751.csv Completed graceful shutdown