java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:39:18,201 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:39:18,203 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:39:18,219 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:39:18,219 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:39:18,220 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:39:18,223 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:39:18,225 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:39:18,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:39:18,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:39:18,237 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:39:18,237 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:39:18,238 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:39:18,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:39:18,242 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:39:18,243 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:39:18,244 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:39:18,246 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:39:18,250 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:39:18,252 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:39:18,253 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:39:18,254 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:39:18,259 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:39:18,259 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:39:18,259 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:39:18,260 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:39:18,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:39:18,263 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:39:18,266 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:39:18,268 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:39:18,268 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:39:18,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:39:18,270 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:39:18,270 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:39:18,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:39:18,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:39:18,274 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:39:18,304 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:39:18,304 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:39:18,308 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:39:18,308 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:39:18,308 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:39:18,309 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:39:18,309 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:39:18,309 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:39:18,309 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:39:18,311 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:39:18,312 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:39:18,312 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:39:18,312 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:39:18,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:39:18,312 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:39:18,313 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:39:18,313 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:39:18,313 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:39:18,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:39:18,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:39:18,314 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:39:18,314 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:39:18,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:39:18,314 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:39:18,314 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:39:18,314 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:39:18,315 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:39:18,315 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:39:18,315 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:39:18,315 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:39:18,319 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:39:18,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:39:18,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:39:18,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:39:18,379 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:39:18,380 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:39:18,381 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2018-10-01 00:39:18,381 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2018-10-01 00:39:18,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:39:18,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:39:18,437 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:39:18,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:39:18,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:39:18,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:18" (1/1) ... [2018-10-01 00:39:18,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:18" (1/1) ... [2018-10-01 00:39:18,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:39:18,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:39:18,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:39:18,480 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:39:18,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:18" (1/1) ... [2018-10-01 00:39:18,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:18" (1/1) ... [2018-10-01 00:39:18,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:18" (1/1) ... [2018-10-01 00:39:18,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:18" (1/1) ... [2018-10-01 00:39:18,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:18" (1/1) ... [2018-10-01 00:39:18,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:18" (1/1) ... [2018-10-01 00:39:18,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:18" (1/1) ... [2018-10-01 00:39:18,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:39:18,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:39:18,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:39:18,502 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:39:18,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:18" (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-10-01 00:39:18,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:39:18,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:39:18,831 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:39:18,832 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:39:18 BoogieIcfgContainer [2018-10-01 00:39:18,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:39:18,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:39:18,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:39:18,837 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:39:18,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:18" (1/2) ... [2018-10-01 00:39:18,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2a37c5 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:39:18, skipping insertion in model container [2018-10-01 00:39:18,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:39:18" (2/2) ... [2018-10-01 00:39:18,840 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2018-10-01 00:39:18,851 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:39:18,859 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:39:18,917 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:39:18,918 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:39:18,918 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:39:18,919 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:39:18,919 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:39:18,919 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:39:18,919 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:39:18,920 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:39:18,920 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:39:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-10-01 00:39:18,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 00:39:18,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:18,944 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-01 00:39:18,946 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:18,953 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:18,954 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-10-01 00:39:18,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:18,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:19,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:19,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:19,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:19,145 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:19,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:39:19,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:39:19,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:39:19,163 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:19,165 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-10-01 00:39:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:19,406 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-10-01 00:39:19,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:39:19,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-10-01 00:39:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:19,424 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:39:19,424 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:39:19,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:39:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:39:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 00:39:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:39:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-10-01 00:39:19,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2018-10-01 00:39:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:19,462 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-10-01 00:39:19,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:39:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-10-01 00:39:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:39:19,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:19,463 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:19,464 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:19,464 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:19,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-10-01 00:39:19,464 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:19,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:19,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:19,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:19,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 00:39:19,524 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:19,524 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-10-01 00:39:19,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:19,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 00:39:19,761 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:19,761 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-01 00:39:19,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:39:19,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:39:19,762 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:19,763 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2018-10-01 00:39:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:20,074 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-10-01 00:39:20,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:39:20,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-01 00:39:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:20,075 INFO L225 Difference]: With dead ends: 21 [2018-10-01 00:39:20,076 INFO L226 Difference]: Without dead ends: 15 [2018-10-01 00:39:20,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-01 00:39:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-01 00:39:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-01 00:39:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-10-01 00:39:20,081 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-10-01 00:39:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:20,082 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-10-01 00:39:20,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:39:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-10-01 00:39:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:39:20,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:20,084 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-10-01 00:39:20,085 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:20,086 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:20,087 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 2 times [2018-10-01 00:39:20,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:20,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:20,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:20,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:20,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-01 00:39:20,184 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:20,184 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-10-01 00:39:20,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:20,234 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:20,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:20,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-01 00:39:20,444 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:20,445 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:39:20,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:39:20,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:39:20,446 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:20,446 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-10-01 00:39:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:20,628 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-10-01 00:39:20,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:39:20,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-01 00:39:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:20,630 INFO L225 Difference]: With dead ends: 27 [2018-10-01 00:39:20,630 INFO L226 Difference]: Without dead ends: 19 [2018-10-01 00:39:20,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-01 00:39:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-01 00:39:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-01 00:39:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-10-01 00:39:20,636 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-10-01 00:39:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:20,636 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-10-01 00:39:20,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:39:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-10-01 00:39:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:39:20,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:20,638 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-10-01 00:39:20,639 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:20,639 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:20,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 3 times [2018-10-01 00:39:20,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:20,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:20,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-01 00:39:20,836 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:20,837 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-10-01 00:39:20,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:20,875 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-01 00:39:20,875 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:20,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-01 00:39:20,955 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:20,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-01 00:39:20,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:39:20,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:39:20,956 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:20,956 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-10-01 00:39:21,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:21,113 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-10-01 00:39:21,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:39:21,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-01 00:39:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:21,118 INFO L225 Difference]: With dead ends: 33 [2018-10-01 00:39:21,118 INFO L226 Difference]: Without dead ends: 23 [2018-10-01 00:39:21,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:21,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-01 00:39:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-01 00:39:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-01 00:39:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-10-01 00:39:21,124 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-10-01 00:39:21,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:21,124 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-01 00:39:21,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:39:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-10-01 00:39:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:39:21,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:21,126 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-10-01 00:39:21,126 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:21,126 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 4 times [2018-10-01 00:39:21,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:21,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:21,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:21,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:21,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-01 00:39:21,248 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:21,248 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-10-01 00:39:21,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:21,298 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:21,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:21,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-01 00:39:21,414 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:21,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-01 00:39:21,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:39:21,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:39:21,415 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:21,415 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2018-10-01 00:39:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:21,922 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-10-01 00:39:21,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:39:21,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-01 00:39:21,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:21,926 INFO L225 Difference]: With dead ends: 39 [2018-10-01 00:39:21,926 INFO L226 Difference]: Without dead ends: 27 [2018-10-01 00:39:21,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-01 00:39:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-01 00:39:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-01 00:39:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-10-01 00:39:21,932 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-10-01 00:39:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:21,932 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-10-01 00:39:21,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:39:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-10-01 00:39:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 00:39:21,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:21,934 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-10-01 00:39:21,934 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:21,934 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:21,934 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 5 times [2018-10-01 00:39:21,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:21,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:21,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:21,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:21,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-01 00:39:22,045 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:22,045 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 00:39:22,053 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:22,073 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-01 00:39:22,074 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:22,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-01 00:39:22,174 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:22,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:39:22,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:39:22,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:39:22,175 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:22,175 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-10-01 00:39:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:22,376 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-10-01 00:39:22,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:39:22,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-01 00:39:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:22,379 INFO L225 Difference]: With dead ends: 45 [2018-10-01 00:39:22,379 INFO L226 Difference]: Without dead ends: 31 [2018-10-01 00:39:22,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-01 00:39:22,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-01 00:39:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-01 00:39:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-10-01 00:39:22,385 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2018-10-01 00:39:22,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:22,386 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-10-01 00:39:22,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:39:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-10-01 00:39:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:39:22,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:22,387 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-10-01 00:39:22,388 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:22,388 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:22,388 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 6 times [2018-10-01 00:39:22,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:22,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:22,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:22,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:22,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-01 00:39:22,504 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:22,504 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-10-01 00:39:22,517 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:22,551 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-01 00:39:22,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:22,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-01 00:39:22,654 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:22,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-01 00:39:22,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:39:22,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:39:22,655 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:22,655 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 9 states. [2018-10-01 00:39:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:22,844 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-10-01 00:39:22,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:39:22,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-01 00:39:22,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:22,846 INFO L225 Difference]: With dead ends: 51 [2018-10-01 00:39:22,846 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:39:22,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:39:22,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-01 00:39:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:39:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-10-01 00:39:22,854 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-10-01 00:39:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:22,854 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-10-01 00:39:22,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:39:22,854 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-10-01 00:39:22,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:39:22,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:22,855 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-10-01 00:39:22,856 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:22,856 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:22,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 7 times [2018-10-01 00:39:22,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:22,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:22,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:22,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:22,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-01 00:39:23,108 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:23,109 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-10-01 00:39:23,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:23,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-01 00:39:23,272 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:23,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-01 00:39:23,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:39:23,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:39:23,273 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:23,274 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 10 states. [2018-10-01 00:39:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:23,521 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-10-01 00:39:23,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:39:23,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-10-01 00:39:23,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:23,523 INFO L225 Difference]: With dead ends: 57 [2018-10-01 00:39:23,523 INFO L226 Difference]: Without dead ends: 39 [2018-10-01 00:39:23,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-01 00:39:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-01 00:39:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-01 00:39:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-10-01 00:39:23,530 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-10-01 00:39:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:23,530 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-10-01 00:39:23,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:39:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-10-01 00:39:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-01 00:39:23,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:23,532 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-10-01 00:39:23,532 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:23,532 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:23,532 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 8 times [2018-10-01 00:39:23,533 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:23,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:23,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:23,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:23,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-01 00:39:23,650 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:23,650 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-10-01 00:39:23,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:23,683 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:23,684 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:23,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-01 00:39:23,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:23,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-01 00:39:23,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:39:23,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:39:23,791 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:23,792 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-10-01 00:39:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:24,102 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-10-01 00:39:24,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:39:24,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-10-01 00:39:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:24,105 INFO L225 Difference]: With dead ends: 63 [2018-10-01 00:39:24,105 INFO L226 Difference]: Without dead ends: 43 [2018-10-01 00:39:24,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-01 00:39:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-01 00:39:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-01 00:39:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-10-01 00:39:24,111 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2018-10-01 00:39:24,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:24,112 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-10-01 00:39:24,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:39:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-10-01 00:39:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-01 00:39:24,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:24,113 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-10-01 00:39:24,114 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:24,114 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:24,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 9 times [2018-10-01 00:39:24,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:24,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:24,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:24,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:24,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-01 00:39:24,256 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:24,256 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-10-01 00:39:24,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:24,412 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-01 00:39:24,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:24,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-01 00:39:24,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:24,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-01 00:39:24,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:39:24,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:39:24,653 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:24,654 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 12 states. [2018-10-01 00:39:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:24,875 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-10-01 00:39:24,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:39:24,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-10-01 00:39:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:24,876 INFO L225 Difference]: With dead ends: 69 [2018-10-01 00:39:24,877 INFO L226 Difference]: Without dead ends: 47 [2018-10-01 00:39:24,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-01 00:39:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-01 00:39:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-01 00:39:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-10-01 00:39:24,885 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2018-10-01 00:39:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:24,885 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-10-01 00:39:24,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:39:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-10-01 00:39:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-01 00:39:24,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:24,887 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-10-01 00:39:24,887 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:24,887 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 10 times [2018-10-01 00:39:24,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:24,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:24,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:24,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:24,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:25,033 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-01 00:39:25,034 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:25,034 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-10-01 00:39:25,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:25,071 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:25,071 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:25,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-01 00:39:25,174 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:25,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-01 00:39:25,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:39:25,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:39:25,176 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:25,176 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 13 states. [2018-10-01 00:39:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:25,373 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-10-01 00:39:25,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:39:25,374 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-10-01 00:39:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:25,375 INFO L225 Difference]: With dead ends: 75 [2018-10-01 00:39:25,375 INFO L226 Difference]: Without dead ends: 51 [2018-10-01 00:39:25,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-01 00:39:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-01 00:39:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-01 00:39:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-10-01 00:39:25,383 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-10-01 00:39:25,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:25,384 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-10-01 00:39:25,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:39:25,384 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-10-01 00:39:25,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-01 00:39:25,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:25,385 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-10-01 00:39:25,386 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:25,386 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:25,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 11 times [2018-10-01 00:39:25,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:25,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:25,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:25,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:25,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-01 00:39:25,574 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:25,574 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-10-01 00:39:25,584 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:25,631 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-01 00:39:25,631 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:25,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-01 00:39:25,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:25,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-01 00:39:25,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:39:25,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:39:25,730 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:25,730 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 14 states. [2018-10-01 00:39:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:26,124 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-10-01 00:39:26,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:39:26,124 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-10-01 00:39:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:26,125 INFO L225 Difference]: With dead ends: 81 [2018-10-01 00:39:26,126 INFO L226 Difference]: Without dead ends: 55 [2018-10-01 00:39:26,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:26,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-01 00:39:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-01 00:39:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-01 00:39:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-10-01 00:39:26,132 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2018-10-01 00:39:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:26,133 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-10-01 00:39:26,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:39:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-10-01 00:39:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-01 00:39:26,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:26,134 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-10-01 00:39:26,134 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:26,134 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 12 times [2018-10-01 00:39:26,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:26,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:26,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-01 00:39:26,297 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:26,297 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-10-01 00:39:26,305 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:26,343 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-01 00:39:26,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:26,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-01 00:39:26,475 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:26,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-01 00:39:26,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:39:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:39:26,476 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:26,476 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 15 states. [2018-10-01 00:39:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:26,713 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-10-01 00:39:26,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:39:26,714 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-10-01 00:39:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:26,715 INFO L225 Difference]: With dead ends: 87 [2018-10-01 00:39:26,715 INFO L226 Difference]: Without dead ends: 59 [2018-10-01 00:39:26,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-01 00:39:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-01 00:39:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-01 00:39:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-10-01 00:39:26,723 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-10-01 00:39:26,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:26,723 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-10-01 00:39:26,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:39:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-10-01 00:39:26,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-01 00:39:26,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:26,724 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-10-01 00:39:26,725 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:26,725 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 13 times [2018-10-01 00:39:26,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:26,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:26,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:26,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:26,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-10-01 00:39:26,894 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:26,895 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-10-01 00:39:26,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:26,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-10-01 00:39:27,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:27,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-01 00:39:27,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:39:27,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:39:27,130 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:27,130 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 16 states. [2018-10-01 00:39:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:27,594 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-10-01 00:39:27,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:39:27,595 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-10-01 00:39:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:27,595 INFO L225 Difference]: With dead ends: 93 [2018-10-01 00:39:27,596 INFO L226 Difference]: Without dead ends: 63 [2018-10-01 00:39:27,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:27,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-01 00:39:27,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-01 00:39:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-01 00:39:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-10-01 00:39:27,602 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2018-10-01 00:39:27,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:27,602 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-10-01 00:39:27,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:39:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-10-01 00:39:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-01 00:39:27,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:27,604 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-10-01 00:39:27,604 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:27,604 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:27,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 14 times [2018-10-01 00:39:27,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:27,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:27,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:27,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:27,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-01 00:39:27,899 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:27,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 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-10-01 00:39:27,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:27,938 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:27,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:27,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-01 00:39:28,097 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:28,097 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-01 00:39:28,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:39:28,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:39:28,098 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:28,098 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 17 states. [2018-10-01 00:39:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:28,425 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-10-01 00:39:28,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:39:28,425 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2018-10-01 00:39:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:28,426 INFO L225 Difference]: With dead ends: 99 [2018-10-01 00:39:28,426 INFO L226 Difference]: Without dead ends: 67 [2018-10-01 00:39:28,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:39:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-01 00:39:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-01 00:39:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-01 00:39:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-10-01 00:39:28,435 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2018-10-01 00:39:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:28,436 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-10-01 00:39:28,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:39:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-10-01 00:39:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 00:39:28,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:28,437 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-10-01 00:39:28,437 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:28,438 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:28,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 15 times [2018-10-01 00:39:28,438 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:28,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:28,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:28,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:28,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-01 00:39:28,657 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:28,657 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-10-01 00:39:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:28,722 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-01 00:39:28,722 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:28,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-01 00:39:28,844 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:28,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-01 00:39:28,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:39:28,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:39:28,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:28,845 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 18 states. [2018-10-01 00:39:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:29,281 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-10-01 00:39:29,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:39:29,281 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-10-01 00:39:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:29,283 INFO L225 Difference]: With dead ends: 105 [2018-10-01 00:39:29,283 INFO L226 Difference]: Without dead ends: 71 [2018-10-01 00:39:29,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-01 00:39:29,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-01 00:39:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-01 00:39:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-10-01 00:39:29,290 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-10-01 00:39:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:29,290 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-10-01 00:39:29,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:39:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-10-01 00:39:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-01 00:39:29,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:29,292 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-10-01 00:39:29,292 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:29,292 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 16 times [2018-10-01 00:39:29,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:29,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:29,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:29,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:29,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-01 00:39:29,552 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:29,552 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-10-01 00:39:29,559 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:29,591 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:29,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:29,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-01 00:39:29,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:29,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-01 00:39:29,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:39:29,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:39:29,715 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:29,715 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 19 states. [2018-10-01 00:39:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:29,949 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-10-01 00:39:29,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:39:29,949 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-10-01 00:39:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:29,950 INFO L225 Difference]: With dead ends: 111 [2018-10-01 00:39:29,951 INFO L226 Difference]: Without dead ends: 75 [2018-10-01 00:39:29,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:39:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-01 00:39:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-01 00:39:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-01 00:39:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-10-01 00:39:29,956 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2018-10-01 00:39:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:29,956 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-10-01 00:39:29,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:39:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-10-01 00:39:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-01 00:39:29,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:29,957 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-10-01 00:39:29,957 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:29,958 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:29,958 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 17 times [2018-10-01 00:39:29,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:29,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:29,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-10-01 00:39:30,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:30,646 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 00:39:30,653 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:30,727 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-01 00:39:30,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:30,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-10-01 00:39:31,048 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:31,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-01 00:39:31,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:39:31,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:39:31,049 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:31,050 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 20 states. [2018-10-01 00:39:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:31,648 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2018-10-01 00:39:31,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:39:31,648 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-10-01 00:39:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:31,649 INFO L225 Difference]: With dead ends: 117 [2018-10-01 00:39:31,649 INFO L226 Difference]: Without dead ends: 79 [2018-10-01 00:39:31,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:39:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-01 00:39:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-01 00:39:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-01 00:39:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-10-01 00:39:31,655 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2018-10-01 00:39:31,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:31,656 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-10-01 00:39:31,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:39:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-10-01 00:39:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-01 00:39:31,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:31,657 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-10-01 00:39:31,657 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:31,658 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:31,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 18 times [2018-10-01 00:39:31,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:31,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:31,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:31,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:31,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-01 00:39:31,933 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:31,933 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-10-01 00:39:31,941 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:32,101 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-01 00:39:32,102 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:32,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:32,269 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-01 00:39:32,290 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:32,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-01 00:39:32,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 00:39:32,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 00:39:32,291 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:32,291 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 21 states. [2018-10-01 00:39:32,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:32,556 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2018-10-01 00:39:32,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:39:32,557 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-10-01 00:39:32,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:32,558 INFO L225 Difference]: With dead ends: 123 [2018-10-01 00:39:32,558 INFO L226 Difference]: Without dead ends: 83 [2018-10-01 00:39:32,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:39:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-01 00:39:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-01 00:39:32,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-01 00:39:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-10-01 00:39:32,563 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2018-10-01 00:39:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:32,563 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-10-01 00:39:32,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 00:39:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-10-01 00:39:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-01 00:39:32,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:32,565 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-10-01 00:39:32,565 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:32,565 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:32,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 19 times [2018-10-01 00:39:32,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:32,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:32,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:32,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:32,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-01 00:39:32,811 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:32,811 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-10-01 00:39:32,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:32,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-01 00:39:32,978 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:32,978 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-01 00:39:32,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:39:32,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:39:32,979 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:32,979 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 22 states. [2018-10-01 00:39:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:33,252 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-10-01 00:39:33,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:39:33,253 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-10-01 00:39:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:33,254 INFO L225 Difference]: With dead ends: 129 [2018-10-01 00:39:33,254 INFO L226 Difference]: Without dead ends: 87 [2018-10-01 00:39:33,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-01 00:39:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-01 00:39:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-01 00:39:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-10-01 00:39:33,259 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2018-10-01 00:39:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:33,260 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-10-01 00:39:33,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:39:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-10-01 00:39:33,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-01 00:39:33,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:33,261 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-10-01 00:39:33,261 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:33,261 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:33,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 20 times [2018-10-01 00:39:33,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:33,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:33,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:33,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:33,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-10-01 00:39:34,023 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:34,023 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 00:39:34,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:34,061 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:34,062 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:34,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-10-01 00:39:34,166 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:34,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-01 00:39:34,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-01 00:39:34,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-01 00:39:34,167 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:34,167 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 23 states. [2018-10-01 00:39:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:34,477 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2018-10-01 00:39:34,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:39:34,477 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-10-01 00:39:34,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:34,478 INFO L225 Difference]: With dead ends: 135 [2018-10-01 00:39:34,478 INFO L226 Difference]: Without dead ends: 91 [2018-10-01 00:39:34,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:39:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-01 00:39:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-01 00:39:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-01 00:39:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-01 00:39:34,482 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2018-10-01 00:39:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:34,482 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-01 00:39:34,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-01 00:39:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-01 00:39:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-01 00:39:34,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:34,483 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-10-01 00:39:34,484 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:34,484 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:34,484 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 21 times [2018-10-01 00:39:34,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:34,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:34,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:34,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:34,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-10-01 00:39:34,874 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:34,874 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 00:39:34,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:34,975 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-01 00:39:34,975 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:34,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-10-01 00:39:35,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:35,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-01 00:39:35,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-01 00:39:35,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-01 00:39:35,137 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:35,138 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 24 states. [2018-10-01 00:39:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:35,437 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-10-01 00:39:35,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:39:35,441 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-10-01 00:39:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:35,441 INFO L225 Difference]: With dead ends: 141 [2018-10-01 00:39:35,441 INFO L226 Difference]: Without dead ends: 95 [2018-10-01 00:39:35,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:39:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-01 00:39:35,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-10-01 00:39:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-01 00:39:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-10-01 00:39:35,445 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 90 [2018-10-01 00:39:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:35,445 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-10-01 00:39:35,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-01 00:39:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-10-01 00:39:35,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-01 00:39:35,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:35,446 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-10-01 00:39:35,446 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:35,447 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:35,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 22 times [2018-10-01 00:39:35,447 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:35,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:35,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:35,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:35,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-10-01 00:39:35,655 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:35,655 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-10-01 00:39:35,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:35,703 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:35,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:35,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-10-01 00:39:35,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:35,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-01 00:39:35,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-01 00:39:35,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-01 00:39:35,880 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:35,880 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 25 states. [2018-10-01 00:39:36,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:36,212 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2018-10-01 00:39:36,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:39:36,218 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-10-01 00:39:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:36,218 INFO L225 Difference]: With dead ends: 147 [2018-10-01 00:39:36,219 INFO L226 Difference]: Without dead ends: 99 [2018-10-01 00:39:36,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:36,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-01 00:39:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-10-01 00:39:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-01 00:39:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-10-01 00:39:36,222 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2018-10-01 00:39:36,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:36,222 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-10-01 00:39:36,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-01 00:39:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-10-01 00:39:36,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-01 00:39:36,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:36,223 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-10-01 00:39:36,223 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:36,224 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:36,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 23 times [2018-10-01 00:39:36,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:36,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:36,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:36,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:36,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-10-01 00:39:36,455 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:36,455 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-10-01 00:39:36,462 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:36,608 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-01 00:39:36,608 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:36,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-10-01 00:39:36,745 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:36,745 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-01 00:39:36,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-01 00:39:36,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-01 00:39:36,746 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:36,746 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 26 states. [2018-10-01 00:39:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:37,095 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2018-10-01 00:39:37,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 00:39:37,095 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 98 [2018-10-01 00:39:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:37,097 INFO L225 Difference]: With dead ends: 153 [2018-10-01 00:39:37,097 INFO L226 Difference]: Without dead ends: 103 [2018-10-01 00:39:37,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-01 00:39:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-01 00:39:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-01 00:39:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-10-01 00:39:37,102 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2018-10-01 00:39:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:37,102 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-10-01 00:39:37,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-01 00:39:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-10-01 00:39:37,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-01 00:39:37,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:37,103 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-10-01 00:39:37,103 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:37,103 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:37,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 24 times [2018-10-01 00:39:37,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:37,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:37,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:37,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:37,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-10-01 00:39:37,313 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:37,313 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-10-01 00:39:37,320 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:37,453 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-01 00:39:37,453 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:37,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-10-01 00:39:37,585 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:37,585 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-01 00:39:37,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-01 00:39:37,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-01 00:39:37,586 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:37,586 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 27 states. [2018-10-01 00:39:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:37,918 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-10-01 00:39:37,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:39:37,919 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2018-10-01 00:39:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:37,920 INFO L225 Difference]: With dead ends: 159 [2018-10-01 00:39:37,920 INFO L226 Difference]: Without dead ends: 107 [2018-10-01 00:39:37,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-01 00:39:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-01 00:39:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-01 00:39:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-10-01 00:39:37,925 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2018-10-01 00:39:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:37,925 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-10-01 00:39:37,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-01 00:39:37,926 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-10-01 00:39:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-01 00:39:37,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:37,926 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-10-01 00:39:37,927 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:37,927 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:37,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 25 times [2018-10-01 00:39:37,927 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:37,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:37,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:37,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:37,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-10-01 00:39:38,127 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:38,127 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-10-01 00:39:38,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:38,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-10-01 00:39:38,302 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:38,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-01 00:39:38,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-01 00:39:38,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-01 00:39:38,303 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:38,303 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 28 states. [2018-10-01 00:39:38,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:38,809 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-10-01 00:39:38,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:39:38,809 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 106 [2018-10-01 00:39:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:38,810 INFO L225 Difference]: With dead ends: 165 [2018-10-01 00:39:38,810 INFO L226 Difference]: Without dead ends: 111 [2018-10-01 00:39:38,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-01 00:39:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-10-01 00:39:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-01 00:39:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-10-01 00:39:38,814 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2018-10-01 00:39:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:38,815 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-10-01 00:39:38,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-01 00:39:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-10-01 00:39:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-01 00:39:38,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:38,816 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-10-01 00:39:38,816 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:38,816 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:38,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 26 times [2018-10-01 00:39:38,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:38,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:38,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:38,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:38,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-10-01 00:39:39,367 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:39,367 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-10-01 00:39:39,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:39,416 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:39,416 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:39,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-10-01 00:39:39,534 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:39,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-01 00:39:39,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-01 00:39:39,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-01 00:39:39,535 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:39,536 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 29 states. [2018-10-01 00:39:39,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:39,945 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-10-01 00:39:39,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:39:39,945 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 110 [2018-10-01 00:39:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:39,946 INFO L225 Difference]: With dead ends: 171 [2018-10-01 00:39:39,946 INFO L226 Difference]: Without dead ends: 115 [2018-10-01 00:39:39,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:39:39,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-01 00:39:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-10-01 00:39:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-01 00:39:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-10-01 00:39:39,951 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2018-10-01 00:39:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:39,951 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-10-01 00:39:39,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-01 00:39:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-10-01 00:39:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-01 00:39:39,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:39,952 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-10-01 00:39:39,952 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:39,953 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 27 times [2018-10-01 00:39:39,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:39,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:39,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:39,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:39,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-10-01 00:39:40,165 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:40,166 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-10-01 00:39:40,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:40,374 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-01 00:39:40,374 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:40,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-10-01 00:39:40,545 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:40,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-01 00:39:40,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-01 00:39:40,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-01 00:39:40,546 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:40,546 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 30 states. [2018-10-01 00:39:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:40,927 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-10-01 00:39:40,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:39:40,927 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 114 [2018-10-01 00:39:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:40,928 INFO L225 Difference]: With dead ends: 177 [2018-10-01 00:39:40,928 INFO L226 Difference]: Without dead ends: 119 [2018-10-01 00:39:40,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-01 00:39:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-10-01 00:39:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-01 00:39:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-10-01 00:39:40,933 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-10-01 00:39:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:40,933 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-10-01 00:39:40,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-01 00:39:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-10-01 00:39:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-01 00:39:40,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:40,934 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-10-01 00:39:40,935 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:40,935 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:40,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 28 times [2018-10-01 00:39:40,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:40,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:40,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:40,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:40,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-10-01 00:39:41,256 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:41,256 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-10-01 00:39:41,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:41,336 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:41,337 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:41,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-10-01 00:39:41,732 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:41,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-01 00:39:41,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-01 00:39:41,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-01 00:39:41,733 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:41,733 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 31 states. [2018-10-01 00:39:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:42,125 INFO L93 Difference]: Finished difference Result 183 states and 186 transitions. [2018-10-01 00:39:42,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:39:42,125 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 118 [2018-10-01 00:39:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:42,126 INFO L225 Difference]: With dead ends: 183 [2018-10-01 00:39:42,127 INFO L226 Difference]: Without dead ends: 123 [2018-10-01 00:39:42,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:39:42,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-01 00:39:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-10-01 00:39:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-01 00:39:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-10-01 00:39:42,132 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2018-10-01 00:39:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:42,132 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-10-01 00:39:42,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-01 00:39:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-10-01 00:39:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-01 00:39:42,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:42,133 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-10-01 00:39:42,133 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:42,134 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:42,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 29 times [2018-10-01 00:39:42,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:42,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:42,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:42,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-10-01 00:39:42,351 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:42,351 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 00:39:42,358 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:42,607 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-01 00:39:42,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:42,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-10-01 00:39:42,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:42,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-01 00:39:42,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-01 00:39:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-01 00:39:42,749 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:42,749 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 32 states. [2018-10-01 00:39:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:43,147 INFO L93 Difference]: Finished difference Result 189 states and 192 transitions. [2018-10-01 00:39:43,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:39:43,147 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 122 [2018-10-01 00:39:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:43,149 INFO L225 Difference]: With dead ends: 189 [2018-10-01 00:39:43,149 INFO L226 Difference]: Without dead ends: 127 [2018-10-01 00:39:43,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:43,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-01 00:39:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-01 00:39:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-01 00:39:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-10-01 00:39:43,154 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2018-10-01 00:39:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:43,154 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-10-01 00:39:43,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-01 00:39:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-10-01 00:39:43,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-01 00:39:43,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:43,155 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-10-01 00:39:43,156 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:43,156 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:43,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 30 times [2018-10-01 00:39:43,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:43,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:43,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:43,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:43,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:43,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-01 00:39:43,438 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:43,438 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-10-01 00:39:43,448 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:43,637 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-01 00:39:43,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:43,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-01 00:39:43,888 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:43,888 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-01 00:39:43,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-01 00:39:43,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-01 00:39:43,889 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:43,889 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 33 states. [2018-10-01 00:39:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:44,384 INFO L93 Difference]: Finished difference Result 195 states and 198 transitions. [2018-10-01 00:39:44,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 00:39:44,384 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 126 [2018-10-01 00:39:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:44,386 INFO L225 Difference]: With dead ends: 195 [2018-10-01 00:39:44,386 INFO L226 Difference]: Without dead ends: 131 [2018-10-01 00:39:44,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:39:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-01 00:39:44,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-10-01 00:39:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-01 00:39:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-10-01 00:39:44,391 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 126 [2018-10-01 00:39:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:44,391 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-10-01 00:39:44,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-01 00:39:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-10-01 00:39:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-01 00:39:44,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:44,392 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-10-01 00:39:44,392 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:44,392 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:44,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 31 times [2018-10-01 00:39:44,393 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:44,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:44,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:44,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:44,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-01 00:39:45,295 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:45,295 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-10-01 00:39:45,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:45,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-01 00:39:45,628 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:45,628 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-01 00:39:45,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-01 00:39:45,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-01 00:39:45,629 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:45,629 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 34 states. [2018-10-01 00:39:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:47,008 INFO L93 Difference]: Finished difference Result 201 states and 204 transitions. [2018-10-01 00:39:47,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:39:47,009 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 130 [2018-10-01 00:39:47,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:47,010 INFO L225 Difference]: With dead ends: 201 [2018-10-01 00:39:47,010 INFO L226 Difference]: Without dead ends: 135 [2018-10-01 00:39:47,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:39:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-01 00:39:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-10-01 00:39:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-01 00:39:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-10-01 00:39:47,015 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 130 [2018-10-01 00:39:47,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:47,016 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-10-01 00:39:47,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-01 00:39:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-10-01 00:39:47,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-01 00:39:47,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:47,016 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-10-01 00:39:47,017 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:47,017 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:47,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 32 times [2018-10-01 00:39:47,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:47,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:47,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:47,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:47,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-10-01 00:39:47,805 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:47,805 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-10-01 00:39:47,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:47,889 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:47,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:47,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-10-01 00:39:48,056 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:48,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-01 00:39:48,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-01 00:39:48,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-01 00:39:48,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:48,058 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 35 states. [2018-10-01 00:39:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:48,526 INFO L93 Difference]: Finished difference Result 207 states and 210 transitions. [2018-10-01 00:39:48,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:39:48,526 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-10-01 00:39:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:48,528 INFO L225 Difference]: With dead ends: 207 [2018-10-01 00:39:48,528 INFO L226 Difference]: Without dead ends: 139 [2018-10-01 00:39:48,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:39:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-01 00:39:48,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-10-01 00:39:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-01 00:39:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-10-01 00:39:48,533 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-10-01 00:39:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:48,533 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-10-01 00:39:48,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-01 00:39:48,534 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-10-01 00:39:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-01 00:39:48,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:48,534 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-10-01 00:39:48,535 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:48,535 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:48,535 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 33 times [2018-10-01 00:39:48,535 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:48,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:48,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:48,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:48,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:48,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2018-10-01 00:39:48,966 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:48,966 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-10-01 00:39:48,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:49,303 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-01 00:39:49,303 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:49,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2018-10-01 00:39:49,653 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:49,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-01 00:39:49,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-01 00:39:49,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-01 00:39:49,654 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:49,654 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 36 states. [2018-10-01 00:39:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:50,130 INFO L93 Difference]: Finished difference Result 213 states and 216 transitions. [2018-10-01 00:39:50,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:39:50,131 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 138 [2018-10-01 00:39:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:50,132 INFO L225 Difference]: With dead ends: 213 [2018-10-01 00:39:50,132 INFO L226 Difference]: Without dead ends: 143 [2018-10-01 00:39:50,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:39:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-01 00:39:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-10-01 00:39:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-01 00:39:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-10-01 00:39:50,137 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 138 [2018-10-01 00:39:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:50,137 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-10-01 00:39:50,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-01 00:39:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-10-01 00:39:50,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-01 00:39:50,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:50,138 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-10-01 00:39:50,138 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:50,139 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:50,139 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 34 times [2018-10-01 00:39:50,139 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:50,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:50,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:50,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:50,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-10-01 00:39:50,848 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:50,849 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-10-01 00:39:50,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:50,916 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:50,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:50,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-10-01 00:39:51,084 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:51,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-01 00:39:51,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-01 00:39:51,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-01 00:39:51,085 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:51,085 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 37 states. [2018-10-01 00:39:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:51,648 INFO L93 Difference]: Finished difference Result 219 states and 222 transitions. [2018-10-01 00:39:51,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:39:51,649 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 142 [2018-10-01 00:39:51,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:51,650 INFO L225 Difference]: With dead ends: 219 [2018-10-01 00:39:51,650 INFO L226 Difference]: Without dead ends: 147 [2018-10-01 00:39:51,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:39:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-01 00:39:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-10-01 00:39:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-01 00:39:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-10-01 00:39:51,655 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 142 [2018-10-01 00:39:51,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:51,656 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-10-01 00:39:51,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-01 00:39:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-10-01 00:39:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-01 00:39:51,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:51,657 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2018-10-01 00:39:51,657 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:51,657 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:51,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1526364071, now seen corresponding path program 35 times [2018-10-01 00:39:51,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:51,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:51,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:51,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:51,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2018-10-01 00:39:52,468 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:52,468 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-10-01 00:39:52,476 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:53,056 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-01 00:39:53,057 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:53,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2018-10-01 00:39:53,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:53,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-01 00:39:53,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-01 00:39:53,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-01 00:39:53,268 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:53,268 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 38 states. [2018-10-01 00:39:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:55,125 INFO L93 Difference]: Finished difference Result 225 states and 228 transitions. [2018-10-01 00:39:55,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-01 00:39:55,126 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 146 [2018-10-01 00:39:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:55,127 INFO L225 Difference]: With dead ends: 225 [2018-10-01 00:39:55,127 INFO L226 Difference]: Without dead ends: 151 [2018-10-01 00:39:55,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:39:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-01 00:39:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-10-01 00:39:55,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-01 00:39:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-10-01 00:39:55,132 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2018-10-01 00:39:55,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:55,132 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-10-01 00:39:55,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-01 00:39:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-10-01 00:39:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-01 00:39:55,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:55,133 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1] [2018-10-01 00:39:55,133 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:55,133 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2109708315, now seen corresponding path program 36 times [2018-10-01 00:39:55,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:55,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:55,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:55,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2018-10-01 00:39:55,553 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:55,553 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 00:39:55,562 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:55,876 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-01 00:39:55,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:55,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2018-10-01 00:39:56,100 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:56,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-01 00:39:56,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-01 00:39:56,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-01 00:39:56,100 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:56,101 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 39 states. [2018-10-01 00:39:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:56,662 INFO L93 Difference]: Finished difference Result 231 states and 234 transitions. [2018-10-01 00:39:56,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:39:56,662 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-10-01 00:39:56,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:56,664 INFO L225 Difference]: With dead ends: 231 [2018-10-01 00:39:56,664 INFO L226 Difference]: Without dead ends: 155 [2018-10-01 00:39:56,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:39:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-01 00:39:56,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-10-01 00:39:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-01 00:39:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-10-01 00:39:56,671 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 150 [2018-10-01 00:39:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:56,671 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-10-01 00:39:56,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-01 00:39:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-10-01 00:39:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-01 00:39:56,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:56,673 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2018-10-01 00:39:56,673 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:56,673 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1900215951, now seen corresponding path program 37 times [2018-10-01 00:39:56,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:56,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:56,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:56,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-10-01 00:39:57,644 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:57,644 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-10-01 00:39:57,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:57,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-10-01 00:39:57,898 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:57,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-01 00:39:57,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-01 00:39:57,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-01 00:39:57,899 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:57,899 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 40 states. [2018-10-01 00:39:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:58,410 INFO L93 Difference]: Finished difference Result 237 states and 240 transitions. [2018-10-01 00:39:58,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-01 00:39:58,411 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 154 [2018-10-01 00:39:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:58,412 INFO L225 Difference]: With dead ends: 237 [2018-10-01 00:39:58,412 INFO L226 Difference]: Without dead ends: 159 [2018-10-01 00:39:58,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:39:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-01 00:39:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-10-01 00:39:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-01 00:39:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-10-01 00:39:58,416 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2018-10-01 00:39:58,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:58,416 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-10-01 00:39:58,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-01 00:39:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-10-01 00:39:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-01 00:39:58,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:58,417 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1] [2018-10-01 00:39:58,417 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:58,417 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:58,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1266046205, now seen corresponding path program 38 times [2018-10-01 00:39:58,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:58,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:58,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:58,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:58,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-10-01 00:39:58,959 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:58,959 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 00:39:58,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:59,036 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:59,036 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:59,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-10-01 00:40:01,033 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:01,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-01 00:40:01,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-01 00:40:01,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-01 00:40:01,034 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:01,034 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 41 states. [2018-10-01 00:40:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:01,730 INFO L93 Difference]: Finished difference Result 243 states and 246 transitions. [2018-10-01 00:40:01,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-01 00:40:01,730 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2018-10-01 00:40:01,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:01,732 INFO L225 Difference]: With dead ends: 243 [2018-10-01 00:40:01,732 INFO L226 Difference]: Without dead ends: 163 [2018-10-01 00:40:01,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 00:40:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-01 00:40:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-10-01 00:40:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-01 00:40:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-10-01 00:40:01,737 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 158 [2018-10-01 00:40:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:01,738 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-10-01 00:40:01,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-01 00:40:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-10-01 00:40:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-01 00:40:01,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:01,739 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2018-10-01 00:40:01,739 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:01,739 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:01,740 INFO L82 PathProgramCache]: Analyzing trace with hash 907582839, now seen corresponding path program 39 times [2018-10-01 00:40:01,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:01,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:01,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:01,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:01,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2018-10-01 00:40:02,181 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:02,181 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-10-01 00:40:02,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:02,691 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-01 00:40:02,691 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:02,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2018-10-01 00:40:02,870 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:02,871 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-01 00:40:02,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-01 00:40:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-01 00:40:02,871 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:02,872 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 42 states. [2018-10-01 00:40:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:03,622 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2018-10-01 00:40:03,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-01 00:40:03,622 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2018-10-01 00:40:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:03,624 INFO L225 Difference]: With dead ends: 249 [2018-10-01 00:40:03,624 INFO L226 Difference]: Without dead ends: 167 [2018-10-01 00:40:03,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-01 00:40:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-10-01 00:40:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-01 00:40:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-10-01 00:40:03,628 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 162 [2018-10-01 00:40:03,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:03,629 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-10-01 00:40:03,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-01 00:40:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-10-01 00:40:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-01 00:40:03,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:03,630 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1] [2018-10-01 00:40:03,630 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:03,630 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:03,630 INFO L82 PathProgramCache]: Analyzing trace with hash 334812651, now seen corresponding path program 40 times [2018-10-01 00:40:03,630 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:03,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:03,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:03,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:03,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-10-01 00:40:03,928 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:03,929 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-10-01 00:40:03,937 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:04,002 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:04,002 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:04,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-10-01 00:40:04,364 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:04,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-01 00:40:04,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-01 00:40:04,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-01 00:40:04,365 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:04,365 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 43 states. [2018-10-01 00:40:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:05,076 INFO L93 Difference]: Finished difference Result 255 states and 258 transitions. [2018-10-01 00:40:05,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-01 00:40:05,076 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 166 [2018-10-01 00:40:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:05,078 INFO L225 Difference]: With dead ends: 255 [2018-10-01 00:40:05,078 INFO L226 Difference]: Without dead ends: 171 [2018-10-01 00:40:05,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-01 00:40:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-10-01 00:40:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-01 00:40:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-10-01 00:40:05,082 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 166 [2018-10-01 00:40:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:05,083 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-10-01 00:40:05,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-01 00:40:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-10-01 00:40:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-01 00:40:05,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:05,084 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2018-10-01 00:40:05,084 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:05,084 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:05,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1537430623, now seen corresponding path program 41 times [2018-10-01 00:40:05,085 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:05,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:05,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:05,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:05,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-10-01 00:40:05,561 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:05,562 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-10-01 00:40:05,577 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:06,412 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-01 00:40:06,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:06,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-10-01 00:40:06,856 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:06,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-01 00:40:06,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-01 00:40:06,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-01 00:40:06,857 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:06,857 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 44 states. [2018-10-01 00:40:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:07,438 INFO L93 Difference]: Finished difference Result 261 states and 264 transitions. [2018-10-01 00:40:07,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-01 00:40:07,438 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 170 [2018-10-01 00:40:07,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:07,440 INFO L225 Difference]: With dead ends: 261 [2018-10-01 00:40:07,440 INFO L226 Difference]: Without dead ends: 175 [2018-10-01 00:40:07,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:40:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-01 00:40:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-10-01 00:40:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-01 00:40:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-10-01 00:40:07,445 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 170 [2018-10-01 00:40:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:07,446 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-10-01 00:40:07,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-01 00:40:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-10-01 00:40:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-01 00:40:07,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:07,447 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1] [2018-10-01 00:40:07,447 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:07,447 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash -903276333, now seen corresponding path program 42 times [2018-10-01 00:40:07,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:07,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:07,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:07,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:07,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2018-10-01 00:40:07,783 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:07,783 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-10-01 00:40:07,798 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:08,253 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-01 00:40:08,253 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:08,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2018-10-01 00:40:08,455 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:08,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-01 00:40:08,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-01 00:40:08,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-01 00:40:08,456 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:08,456 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 45 states. [2018-10-01 00:40:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:09,019 INFO L93 Difference]: Finished difference Result 267 states and 270 transitions. [2018-10-01 00:40:09,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-01 00:40:09,020 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 174 [2018-10-01 00:40:09,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:09,021 INFO L225 Difference]: With dead ends: 267 [2018-10-01 00:40:09,021 INFO L226 Difference]: Without dead ends: 179 [2018-10-01 00:40:09,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:09,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-01 00:40:09,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-10-01 00:40:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-01 00:40:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-10-01 00:40:09,027 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 174 [2018-10-01 00:40:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:09,027 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-10-01 00:40:09,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-01 00:40:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-10-01 00:40:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-01 00:40:09,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:09,029 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2018-10-01 00:40:09,029 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:09,029 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1945427129, now seen corresponding path program 43 times [2018-10-01 00:40:09,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:09,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:09,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:09,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:09,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-10-01 00:40:09,599 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:09,599 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-10-01 00:40:09,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:09,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-10-01 00:40:09,869 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:09,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-01 00:40:09,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-01 00:40:09,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-01 00:40:09,870 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:09,870 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 46 states. [2018-10-01 00:40:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:10,457 INFO L93 Difference]: Finished difference Result 273 states and 276 transitions. [2018-10-01 00:40:10,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-01 00:40:10,457 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 178 [2018-10-01 00:40:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:10,459 INFO L225 Difference]: With dead ends: 273 [2018-10-01 00:40:10,459 INFO L226 Difference]: Without dead ends: 183 [2018-10-01 00:40:10,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:40:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-01 00:40:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-10-01 00:40:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-01 00:40:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-10-01 00:40:10,463 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 178 [2018-10-01 00:40:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:10,463 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-10-01 00:40:10,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-01 00:40:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-10-01 00:40:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-01 00:40:10,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:10,464 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1] [2018-10-01 00:40:10,464 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:10,464 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:10,465 INFO L82 PathProgramCache]: Analyzing trace with hash -45190213, now seen corresponding path program 44 times [2018-10-01 00:40:10,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:10,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:10,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:10,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:10,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-01 00:40:11,104 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:11,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 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-10-01 00:40:11,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:11,188 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:11,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:11,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-01 00:40:11,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:11,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-01 00:40:11,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-01 00:40:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-01 00:40:11,404 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:11,404 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 47 states. [2018-10-01 00:40:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:12,053 INFO L93 Difference]: Finished difference Result 279 states and 282 transitions. [2018-10-01 00:40:12,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 00:40:12,053 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 182 [2018-10-01 00:40:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:12,055 INFO L225 Difference]: With dead ends: 279 [2018-10-01 00:40:12,055 INFO L226 Difference]: Without dead ends: 187 [2018-10-01 00:40:12,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:40:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-01 00:40:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-10-01 00:40:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-01 00:40:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-10-01 00:40:12,060 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 182 [2018-10-01 00:40:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:12,061 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-10-01 00:40:12,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-01 00:40:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-10-01 00:40:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-01 00:40:12,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:12,062 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2018-10-01 00:40:12,062 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:12,063 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:12,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1769474607, now seen corresponding path program 45 times [2018-10-01 00:40:12,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:12,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:12,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:12,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:12,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2018-10-01 00:40:12,552 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:12,552 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-10-01 00:40:12,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:13,444 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-01 00:40:13,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:13,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2018-10-01 00:40:13,782 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:13,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-01 00:40:13,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-01 00:40:13,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-01 00:40:13,783 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:13,784 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 48 states. [2018-10-01 00:40:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:14,535 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2018-10-01 00:40:14,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-01 00:40:14,535 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 186 [2018-10-01 00:40:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:14,536 INFO L225 Difference]: With dead ends: 285 [2018-10-01 00:40:14,537 INFO L226 Difference]: Without dead ends: 191 [2018-10-01 00:40:14,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:40:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-01 00:40:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-10-01 00:40:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-01 00:40:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-10-01 00:40:14,542 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 186 [2018-10-01 00:40:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:14,542 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-10-01 00:40:14,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-01 00:40:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-10-01 00:40:14,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-01 00:40:14,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:14,544 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1] [2018-10-01 00:40:14,544 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:14,544 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:14,544 INFO L82 PathProgramCache]: Analyzing trace with hash -879958365, now seen corresponding path program 46 times [2018-10-01 00:40:14,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:14,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:14,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:14,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:14,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-10-01 00:40:15,996 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:15,996 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-10-01 00:40:16,007 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:16,082 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:16,082 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:16,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-10-01 00:40:16,301 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:16,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-01 00:40:16,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-01 00:40:16,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-01 00:40:16,302 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:16,302 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 49 states. [2018-10-01 00:40:16,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:16,945 INFO L93 Difference]: Finished difference Result 291 states and 294 transitions. [2018-10-01 00:40:16,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-01 00:40:16,946 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 190 [2018-10-01 00:40:16,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:16,947 INFO L225 Difference]: With dead ends: 291 [2018-10-01 00:40:16,947 INFO L226 Difference]: Without dead ends: 195 [2018-10-01 00:40:16,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:40:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-01 00:40:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-10-01 00:40:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-01 00:40:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-10-01 00:40:16,952 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 190 [2018-10-01 00:40:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:16,952 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-10-01 00:40:16,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-01 00:40:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-10-01 00:40:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-01 00:40:16,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:16,953 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2018-10-01 00:40:16,954 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:16,954 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:16,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1911420649, now seen corresponding path program 47 times [2018-10-01 00:40:16,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:16,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:16,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:16,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:16,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-10-01 00:40:17,300 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:17,300 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-10-01 00:40:17,308 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:18,377 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-01 00:40:18,378 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:18,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-10-01 00:40:18,649 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:18,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-01 00:40:18,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-01 00:40:18,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-01 00:40:18,650 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:18,650 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 50 states. [2018-10-01 00:40:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:19,324 INFO L93 Difference]: Finished difference Result 297 states and 300 transitions. [2018-10-01 00:40:19,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-01 00:40:19,324 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 194 [2018-10-01 00:40:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:19,326 INFO L225 Difference]: With dead ends: 297 [2018-10-01 00:40:19,326 INFO L226 Difference]: Without dead ends: 199 [2018-10-01 00:40:19,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:19,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-01 00:40:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-10-01 00:40:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-01 00:40:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-10-01 00:40:19,331 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 194 [2018-10-01 00:40:19,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:19,331 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-10-01 00:40:19,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-01 00:40:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-10-01 00:40:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-01 00:40:19,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:19,332 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1] [2018-10-01 00:40:19,332 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:19,332 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:19,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1259106699, now seen corresponding path program 48 times [2018-10-01 00:40:19,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:19,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:19,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:19,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:19,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-10-01 00:40:19,938 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:19,938 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:19,945 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:20,673 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-01 00:40:20,673 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:20,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-10-01 00:40:20,892 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:20,892 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-01 00:40:20,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-01 00:40:20,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-01 00:40:20,893 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:20,893 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 51 states. [2018-10-01 00:40:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:21,601 INFO L93 Difference]: Finished difference Result 303 states and 306 transitions. [2018-10-01 00:40:21,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-01 00:40:21,601 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 198 [2018-10-01 00:40:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:21,602 INFO L225 Difference]: With dead ends: 303 [2018-10-01 00:40:21,603 INFO L226 Difference]: Without dead ends: 203 [2018-10-01 00:40:21,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:40:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-01 00:40:21,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-10-01 00:40:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-01 00:40:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-10-01 00:40:21,610 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 198 [2018-10-01 00:40:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:21,610 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-10-01 00:40:21,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-01 00:40:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-10-01 00:40:21,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-01 00:40:21,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:21,611 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2018-10-01 00:40:21,612 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:21,612 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:21,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1946083329, now seen corresponding path program 49 times [2018-10-01 00:40:21,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:21,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:21,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:21,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:21,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-01 00:40:21,938 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:21,938 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 00:40:21,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:22,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-01 00:40:22,241 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:22,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-01 00:40:22,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-01 00:40:22,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-01 00:40:22,242 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:22,242 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 52 states. [2018-10-01 00:40:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:22,953 INFO L93 Difference]: Finished difference Result 309 states and 312 transitions. [2018-10-01 00:40:22,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 00:40:22,953 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 202 [2018-10-01 00:40:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:22,955 INFO L225 Difference]: With dead ends: 309 [2018-10-01 00:40:22,955 INFO L226 Difference]: Without dead ends: 207 [2018-10-01 00:40:22,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-01 00:40:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-10-01 00:40:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-01 00:40:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-10-01 00:40:22,959 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 202 [2018-10-01 00:40:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:22,959 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-10-01 00:40:22,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-01 00:40:22,959 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-10-01 00:40:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-01 00:40:22,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:22,960 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1] [2018-10-01 00:40:22,961 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:22,961 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:22,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1980427149, now seen corresponding path program 50 times [2018-10-01 00:40:22,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:22,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:22,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:22,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:22,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-01 00:40:23,375 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:23,375 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-10-01 00:40:23,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:23,466 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:23,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:23,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-01 00:40:23,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:23,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-01 00:40:23,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-01 00:40:23,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-01 00:40:23,685 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:23,685 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 53 states. [2018-10-01 00:40:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:24,533 INFO L93 Difference]: Finished difference Result 315 states and 318 transitions. [2018-10-01 00:40:24,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 00:40:24,534 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 206 [2018-10-01 00:40:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:24,536 INFO L225 Difference]: With dead ends: 315 [2018-10-01 00:40:24,536 INFO L226 Difference]: Without dead ends: 211 [2018-10-01 00:40:24,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-01 00:40:24,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-10-01 00:40:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-01 00:40:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-10-01 00:40:24,541 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 206 [2018-10-01 00:40:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:24,541 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-10-01 00:40:24,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-01 00:40:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-10-01 00:40:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-01 00:40:24,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:24,543 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2018-10-01 00:40:24,543 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:24,543 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:24,543 INFO L82 PathProgramCache]: Analyzing trace with hash -311603481, now seen corresponding path program 51 times [2018-10-01 00:40:24,543 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:24,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:24,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:24,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:24,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 2652 trivial. 0 not checked. [2018-10-01 00:40:25,485 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:25,485 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-10-01 00:40:25,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:26,665 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-01 00:40:26,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:26,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 2652 trivial. 0 not checked. [2018-10-01 00:40:27,579 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:27,579 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-01 00:40:27,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-01 00:40:27,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-01 00:40:27,580 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:27,580 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 54 states. [2018-10-01 00:40:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:28,411 INFO L93 Difference]: Finished difference Result 321 states and 324 transitions. [2018-10-01 00:40:28,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-01 00:40:28,411 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2018-10-01 00:40:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:28,413 INFO L225 Difference]: With dead ends: 321 [2018-10-01 00:40:28,413 INFO L226 Difference]: Without dead ends: 215 [2018-10-01 00:40:28,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:40:28,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-01 00:40:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-10-01 00:40:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-01 00:40:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-10-01 00:40:28,418 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 210 [2018-10-01 00:40:28,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:28,418 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-10-01 00:40:28,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-01 00:40:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-10-01 00:40:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-01 00:40:28,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:28,419 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1] [2018-10-01 00:40:28,420 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:28,420 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:28,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1905340581, now seen corresponding path program 52 times [2018-10-01 00:40:28,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:28,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:28,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:28,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:28,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2018-10-01 00:40:28,787 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:28,787 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:28,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:28,881 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:28,881 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:28,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2018-10-01 00:40:29,117 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:29,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-01 00:40:29,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-01 00:40:29,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-01 00:40:29,118 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:29,118 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 55 states. [2018-10-01 00:40:30,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:30,151 INFO L93 Difference]: Finished difference Result 327 states and 330 transitions. [2018-10-01 00:40:30,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-01 00:40:30,151 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 214 [2018-10-01 00:40:30,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:30,153 INFO L225 Difference]: With dead ends: 327 [2018-10-01 00:40:30,153 INFO L226 Difference]: Without dead ends: 219 [2018-10-01 00:40:30,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-01 00:40:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-10-01 00:40:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-01 00:40:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-10-01 00:40:30,157 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 214 [2018-10-01 00:40:30,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:30,158 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-10-01 00:40:30,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-01 00:40:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-10-01 00:40:30,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-01 00:40:30,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:30,159 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2018-10-01 00:40:30,159 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:30,159 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:30,159 INFO L82 PathProgramCache]: Analyzing trace with hash 880711119, now seen corresponding path program 53 times [2018-10-01 00:40:30,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:30,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:30,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:30,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:30,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-10-01 00:40:30,738 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:30,738 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:30,745 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:32,560 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-01 00:40:32,560 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:32,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-10-01 00:40:32,838 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:32,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-01 00:40:32,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-01 00:40:32,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-01 00:40:32,839 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:32,839 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 56 states. [2018-10-01 00:40:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:33,675 INFO L93 Difference]: Finished difference Result 333 states and 336 transitions. [2018-10-01 00:40:33,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-01 00:40:33,676 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 218 [2018-10-01 00:40:33,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:33,677 INFO L225 Difference]: With dead ends: 333 [2018-10-01 00:40:33,677 INFO L226 Difference]: Without dead ends: 223 [2018-10-01 00:40:33,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:40:33,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-01 00:40:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-10-01 00:40:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-01 00:40:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-10-01 00:40:33,680 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 218 [2018-10-01 00:40:33,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:33,681 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-10-01 00:40:33,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-01 00:40:33,681 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-10-01 00:40:33,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-01 00:40:33,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:33,682 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1] [2018-10-01 00:40:33,682 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:33,682 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:33,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1453433411, now seen corresponding path program 54 times [2018-10-01 00:40:33,682 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:33,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:33,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:33,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:33,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-01 00:40:34,008 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:34,008 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:34,015 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:34,933 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-01 00:40:34,933 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:34,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-01 00:40:35,384 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:35,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-01 00:40:35,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-01 00:40:35,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-01 00:40:35,385 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:35,385 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 57 states. [2018-10-01 00:40:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:36,500 INFO L93 Difference]: Finished difference Result 339 states and 342 transitions. [2018-10-01 00:40:36,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-01 00:40:36,501 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2018-10-01 00:40:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:36,502 INFO L225 Difference]: With dead ends: 339 [2018-10-01 00:40:36,502 INFO L226 Difference]: Without dead ends: 227 [2018-10-01 00:40:36,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:40:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-01 00:40:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-10-01 00:40:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-01 00:40:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-10-01 00:40:36,508 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 222 [2018-10-01 00:40:36,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:36,509 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-10-01 00:40:36,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-01 00:40:36,509 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-10-01 00:40:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-01 00:40:36,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:36,510 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2018-10-01 00:40:36,510 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:36,511 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:36,511 INFO L82 PathProgramCache]: Analyzing trace with hash -614665033, now seen corresponding path program 55 times [2018-10-01 00:40:36,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:36,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:36,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:36,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:36,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-01 00:40:36,952 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:36,953 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:36,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:37,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-01 00:40:37,322 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:37,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-01 00:40:37,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-01 00:40:37,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-01 00:40:37,324 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:37,324 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 58 states. [2018-10-01 00:40:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:38,938 INFO L93 Difference]: Finished difference Result 345 states and 348 transitions. [2018-10-01 00:40:38,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-01 00:40:38,939 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 226 [2018-10-01 00:40:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:38,940 INFO L225 Difference]: With dead ends: 345 [2018-10-01 00:40:38,940 INFO L226 Difference]: Without dead ends: 231 [2018-10-01 00:40:38,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-01 00:40:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-10-01 00:40:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-01 00:40:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-10-01 00:40:38,946 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 226 [2018-10-01 00:40:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:38,946 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-10-01 00:40:38,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-01 00:40:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-10-01 00:40:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-01 00:40:38,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:38,947 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1] [2018-10-01 00:40:38,947 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:38,948 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:38,948 INFO L82 PathProgramCache]: Analyzing trace with hash -659190485, now seen corresponding path program 56 times [2018-10-01 00:40:38,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:38,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:38,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:38,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:38,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2018-10-01 00:40:39,349 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:39,349 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:39,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:39,462 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:39,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:39,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2018-10-01 00:40:39,876 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:39,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-01 00:40:39,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-01 00:40:39,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-01 00:40:39,877 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:39,877 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 59 states. [2018-10-01 00:40:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:40,908 INFO L93 Difference]: Finished difference Result 351 states and 354 transitions. [2018-10-01 00:40:40,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-01 00:40:40,909 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 230 [2018-10-01 00:40:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:40,910 INFO L225 Difference]: With dead ends: 351 [2018-10-01 00:40:40,910 INFO L226 Difference]: Without dead ends: 235 [2018-10-01 00:40:40,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:40:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-01 00:40:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-01 00:40:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-01 00:40:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-10-01 00:40:40,914 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 230 [2018-10-01 00:40:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:40,914 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-10-01 00:40:40,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-01 00:40:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-10-01 00:40:40,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-01 00:40:40,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:40,915 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2018-10-01 00:40:40,916 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:40,916 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:40,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1412459423, now seen corresponding path program 57 times [2018-10-01 00:40:40,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:40,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:40,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:40,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:40,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2018-10-01 00:40:41,279 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:41,279 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:41,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:43,079 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-01 00:40:43,080 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:43,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2018-10-01 00:40:43,322 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:43,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-01 00:40:43,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-01 00:40:43,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-01 00:40:43,323 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:43,323 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 60 states. [2018-10-01 00:40:44,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:44,251 INFO L93 Difference]: Finished difference Result 357 states and 360 transitions. [2018-10-01 00:40:44,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-01 00:40:44,252 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 234 [2018-10-01 00:40:44,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:44,253 INFO L225 Difference]: With dead ends: 357 [2018-10-01 00:40:44,253 INFO L226 Difference]: Without dead ends: 239 [2018-10-01 00:40:44,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-01 00:40:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-01 00:40:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-01 00:40:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-10-01 00:40:44,258 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 234 [2018-10-01 00:40:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:44,258 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-10-01 00:40:44,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-01 00:40:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-10-01 00:40:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-01 00:40:44,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:44,259 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1] [2018-10-01 00:40:44,259 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:44,259 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:44,259 INFO L82 PathProgramCache]: Analyzing trace with hash 47353875, now seen corresponding path program 58 times [2018-10-01 00:40:44,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:44,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:44,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:44,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:44,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2018-10-01 00:40:44,594 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:44,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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:44,605 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:44,700 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:44,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:44,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2018-10-01 00:40:44,948 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:44,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-01 00:40:44,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-01 00:40:44,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-01 00:40:44,949 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:44,949 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 61 states. [2018-10-01 00:40:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:46,095 INFO L93 Difference]: Finished difference Result 363 states and 366 transitions. [2018-10-01 00:40:46,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-01 00:40:46,096 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 238 [2018-10-01 00:40:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:46,097 INFO L225 Difference]: With dead ends: 363 [2018-10-01 00:40:46,097 INFO L226 Difference]: Without dead ends: 243 [2018-10-01 00:40:46,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-01 00:40:46,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-10-01 00:40:46,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-01 00:40:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-10-01 00:40:46,103 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 238 [2018-10-01 00:40:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:46,103 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-10-01 00:40:46,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-01 00:40:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-10-01 00:40:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-01 00:40:46,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:46,104 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2018-10-01 00:40:46,104 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:46,104 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:46,105 INFO L82 PathProgramCache]: Analyzing trace with hash 153156231, now seen corresponding path program 59 times [2018-10-01 00:40:46,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:46,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:46,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:46,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:46,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-01 00:40:46,559 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:46,559 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:46,567 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:49,090 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-01 00:40:49,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:49,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-01 00:40:49,385 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:49,385 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-01 00:40:49,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-01 00:40:49,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-01 00:40:49,386 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:49,386 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 62 states. [2018-10-01 00:40:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:50,730 INFO L93 Difference]: Finished difference Result 369 states and 372 transitions. [2018-10-01 00:40:50,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-01 00:40:50,730 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 242 [2018-10-01 00:40:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:50,732 INFO L225 Difference]: With dead ends: 369 [2018-10-01 00:40:50,732 INFO L226 Difference]: Without dead ends: 247 [2018-10-01 00:40:50,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-01 00:40:50,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-10-01 00:40:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-01 00:40:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-10-01 00:40:50,738 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 242 [2018-10-01 00:40:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:50,738 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-10-01 00:40:50,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-01 00:40:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-10-01 00:40:50,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-01 00:40:50,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:50,739 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1] [2018-10-01 00:40:50,740 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:50,740 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:50,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1155486981, now seen corresponding path program 60 times [2018-10-01 00:40:50,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:50,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:50,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:50,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:50,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2018-10-01 00:40:51,168 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:51,168 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:51,177 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:52,706 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-01 00:40:52,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:52,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2018-10-01 00:40:52,966 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:52,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-01 00:40:52,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-01 00:40:52,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-01 00:40:52,967 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:52,967 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 63 states. [2018-10-01 00:40:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:54,040 INFO L93 Difference]: Finished difference Result 375 states and 378 transitions. [2018-10-01 00:40:54,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-01 00:40:54,041 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 246 [2018-10-01 00:40:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:54,042 INFO L225 Difference]: With dead ends: 375 [2018-10-01 00:40:54,042 INFO L226 Difference]: Without dead ends: 251 [2018-10-01 00:40:54,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-01 00:40:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-10-01 00:40:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-01 00:40:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-10-01 00:40:54,048 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 246 [2018-10-01 00:40:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:54,048 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-10-01 00:40:54,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-01 00:40:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-10-01 00:40:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-01 00:40:54,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:54,049 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1] [2018-10-01 00:40:54,049 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:54,049 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:54,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1549181295, now seen corresponding path program 61 times [2018-10-01 00:40:54,050 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:54,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:54,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:54,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:54,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2018-10-01 00:40:54,438 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:54,438 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:54,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:54,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2018-10-01 00:40:54,802 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:54,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-01 00:40:54,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-01 00:40:54,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-01 00:40:54,803 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:54,803 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 64 states. [2018-10-01 00:40:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:56,029 INFO L93 Difference]: Finished difference Result 381 states and 384 transitions. [2018-10-01 00:40:56,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-01 00:40:56,029 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 250 [2018-10-01 00:40:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:56,031 INFO L225 Difference]: With dead ends: 381 [2018-10-01 00:40:56,031 INFO L226 Difference]: Without dead ends: 255 [2018-10-01 00:40:56,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-01 00:40:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-10-01 00:40:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-01 00:40:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-10-01 00:40:56,035 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 250 [2018-10-01 00:40:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:56,036 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-10-01 00:40:56,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-01 00:40:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-10-01 00:40:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-01 00:40:56,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:56,037 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1] [2018-10-01 00:40:56,037 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:56,037 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:56,037 INFO L82 PathProgramCache]: Analyzing trace with hash -540549661, now seen corresponding path program 62 times [2018-10-01 00:40:56,037 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:56,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:56,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:56,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:56,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2018-10-01 00:40:56,447 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:56,447 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:56,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:56,556 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:56,557 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:56,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2018-10-01 00:40:56,810 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:56,811 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-01 00:40:56,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-01 00:40:56,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-01 00:40:56,812 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:56,812 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 65 states. [2018-10-01 00:40:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:57,916 INFO L93 Difference]: Finished difference Result 387 states and 390 transitions. [2018-10-01 00:40:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-01 00:40:57,917 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 254 [2018-10-01 00:40:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:57,918 INFO L225 Difference]: With dead ends: 387 [2018-10-01 00:40:57,918 INFO L226 Difference]: Without dead ends: 259 [2018-10-01 00:40:57,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-01 00:40:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-10-01 00:40:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-01 00:40:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-10-01 00:40:57,922 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 254 [2018-10-01 00:40:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:57,922 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-10-01 00:40:57,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-01 00:40:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-10-01 00:40:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-01 00:40:57,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:57,923 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1] [2018-10-01 00:40:57,923 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:57,924 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:57,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1476829097, now seen corresponding path program 63 times [2018-10-01 00:40:57,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:57,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:57,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:57,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:57,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2018-10-01 00:40:58,349 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:58,349 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:58,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:00,821 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-01 00:41:00,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:00,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2018-10-01 00:41:01,081 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:01,081 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-01 00:41:01,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-01 00:41:01,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-01 00:41:01,082 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:01,082 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 66 states. [2018-10-01 00:41:02,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:02,234 INFO L93 Difference]: Finished difference Result 393 states and 396 transitions. [2018-10-01 00:41:02,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-01 00:41:02,234 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 258 [2018-10-01 00:41:02,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:02,236 INFO L225 Difference]: With dead ends: 393 [2018-10-01 00:41:02,236 INFO L226 Difference]: Without dead ends: 263 [2018-10-01 00:41:02,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-01 00:41:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-10-01 00:41:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-01 00:41:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-10-01 00:41:02,242 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 258 [2018-10-01 00:41:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:02,242 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-10-01 00:41:02,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-01 00:41:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-10-01 00:41:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-01 00:41:02,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:02,244 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1, 1, 1] [2018-10-01 00:41:02,244 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:02,244 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:02,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1190144203, now seen corresponding path program 64 times [2018-10-01 00:41:02,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:02,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:02,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:02,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:02,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2018-10-01 00:41:02,694 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:02,694 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:02,702 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:02,802 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:02,803 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:02,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2018-10-01 00:41:03,074 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:03,074 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-01 00:41:03,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-01 00:41:03,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-01 00:41:03,075 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:03,075 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 67 states. [2018-10-01 00:41:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:04,223 INFO L93 Difference]: Finished difference Result 399 states and 402 transitions. [2018-10-01 00:41:04,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-01 00:41:04,223 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 262 [2018-10-01 00:41:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:04,225 INFO L225 Difference]: With dead ends: 399 [2018-10-01 00:41:04,225 INFO L226 Difference]: Without dead ends: 267 [2018-10-01 00:41:04,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:04,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-01 00:41:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-10-01 00:41:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-01 00:41:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-10-01 00:41:04,231 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 262 [2018-10-01 00:41:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:04,231 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-10-01 00:41:04,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-01 00:41:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-10-01 00:41:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-01 00:41:04,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:04,233 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1] [2018-10-01 00:41:04,233 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:04,233 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:04,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1043412799, now seen corresponding path program 65 times [2018-10-01 00:41:04,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:04,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:04,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:04,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:04,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-01 00:41:04,664 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:04,664 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:04,672 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:41:08,054 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-01 00:41:08,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:08,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-01 00:41:08,363 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:08,363 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-01 00:41:08,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-01 00:41:08,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-01 00:41:08,364 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:08,364 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 68 states. [2018-10-01 00:41:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:09,850 INFO L93 Difference]: Finished difference Result 405 states and 408 transitions. [2018-10-01 00:41:09,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-01 00:41:09,850 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 266 [2018-10-01 00:41:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:09,852 INFO L225 Difference]: With dead ends: 405 [2018-10-01 00:41:09,852 INFO L226 Difference]: Without dead ends: 271 [2018-10-01 00:41:09,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-01 00:41:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-10-01 00:41:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-01 00:41:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-10-01 00:41:09,857 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 266 [2018-10-01 00:41:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:09,857 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-10-01 00:41:09,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-01 00:41:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-10-01 00:41:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-01 00:41:09,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:09,859 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1, 1, 1] [2018-10-01 00:41:09,859 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:09,860 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:09,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1094612045, now seen corresponding path program 66 times [2018-10-01 00:41:09,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:09,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:09,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2018-10-01 00:41:10,341 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:10,341 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:10,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:41:12,155 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-01 00:41:12,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:12,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2018-10-01 00:41:12,475 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:12,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-01 00:41:12,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-01 00:41:12,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-01 00:41:12,477 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:12,477 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 69 states. [2018-10-01 00:41:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:13,700 INFO L93 Difference]: Finished difference Result 411 states and 414 transitions. [2018-10-01 00:41:13,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-01 00:41:13,701 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 270 [2018-10-01 00:41:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:13,702 INFO L225 Difference]: With dead ends: 411 [2018-10-01 00:41:13,702 INFO L226 Difference]: Without dead ends: 275 [2018-10-01 00:41:13,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:13,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-01 00:41:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-10-01 00:41:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-01 00:41:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-10-01 00:41:13,707 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 270 [2018-10-01 00:41:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:13,707 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-10-01 00:41:13,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-01 00:41:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-10-01 00:41:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-01 00:41:13,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:13,709 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1] [2018-10-01 00:41:13,709 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:13,709 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:13,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1764107815, now seen corresponding path program 67 times [2018-10-01 00:41:13,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:13,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:13,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:13,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:13,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2018-10-01 00:41:14,128 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:14,128 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:14,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:14,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2018-10-01 00:41:14,524 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:14,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-01 00:41:14,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-01 00:41:14,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-01 00:41:14,525 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:14,525 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 70 states. [2018-10-01 00:41:16,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:16,145 INFO L93 Difference]: Finished difference Result 417 states and 420 transitions. [2018-10-01 00:41:16,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-01 00:41:16,145 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 274 [2018-10-01 00:41:16,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:16,147 INFO L225 Difference]: With dead ends: 417 [2018-10-01 00:41:16,147 INFO L226 Difference]: Without dead ends: 279 [2018-10-01 00:41:16,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:16,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-01 00:41:16,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-10-01 00:41:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-01 00:41:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-10-01 00:41:16,152 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 274 [2018-10-01 00:41:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:16,152 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-10-01 00:41:16,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-01 00:41:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-10-01 00:41:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-01 00:41:16,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:16,154 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1, 1, 1] [2018-10-01 00:41:16,154 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:16,154 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:16,155 INFO L82 PathProgramCache]: Analyzing trace with hash 224659099, now seen corresponding path program 68 times [2018-10-01 00:41:16,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:16,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:16,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:16,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:16,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2018-10-01 00:41:16,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:16,582 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:16,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:41:16,702 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:41:16,702 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:16,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:16,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2018-10-01 00:41:16,981 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:16,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-01 00:41:16,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-01 00:41:16,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-01 00:41:16,982 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:16,982 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 71 states. [2018-10-01 00:41:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:18,323 INFO L93 Difference]: Finished difference Result 423 states and 426 transitions. [2018-10-01 00:41:18,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-01 00:41:18,324 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 278 [2018-10-01 00:41:18,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:18,326 INFO L225 Difference]: With dead ends: 423 [2018-10-01 00:41:18,326 INFO L226 Difference]: Without dead ends: 283 [2018-10-01 00:41:18,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-01 00:41:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-10-01 00:41:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-01 00:41:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-10-01 00:41:18,331 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 278 [2018-10-01 00:41:18,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:18,331 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-10-01 00:41:18,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-01 00:41:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-10-01 00:41:18,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-01 00:41:18,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:18,332 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1] [2018-10-01 00:41:18,332 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:18,332 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:18,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1795173647, now seen corresponding path program 69 times [2018-10-01 00:41:18,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:18,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:18,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:18,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:18,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2018-10-01 00:41:18,761 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:18,761 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:18,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:22,154 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-01 00:41:22,154 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:22,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2018-10-01 00:41:22,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:22,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-01 00:41:22,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-01 00:41:22,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-01 00:41:22,451 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:22,451 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 72 states. [2018-10-01 00:41:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:23,733 INFO L93 Difference]: Finished difference Result 429 states and 432 transitions. [2018-10-01 00:41:23,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-01 00:41:23,734 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 282 [2018-10-01 00:41:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:23,735 INFO L225 Difference]: With dead ends: 429 [2018-10-01 00:41:23,735 INFO L226 Difference]: Without dead ends: 287 [2018-10-01 00:41:23,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-01 00:41:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-10-01 00:41:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-01 00:41:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-10-01 00:41:23,740 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 282 [2018-10-01 00:41:23,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:23,741 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-10-01 00:41:23,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-01 00:41:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-10-01 00:41:23,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-01 00:41:23,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:23,742 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1, 1, 1] [2018-10-01 00:41:23,742 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:23,742 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:23,742 INFO L82 PathProgramCache]: Analyzing trace with hash -251684477, now seen corresponding path program 70 times [2018-10-01 00:41:23,742 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:23,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:23,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:23,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:23,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2018-10-01 00:41:24,187 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:24,187 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:24,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:24,307 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:24,307 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:24,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2018-10-01 00:41:24,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:24,604 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-01 00:41:24,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-01 00:41:24,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-01 00:41:24,605 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:24,605 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 73 states. [2018-10-01 00:41:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:25,918 INFO L93 Difference]: Finished difference Result 435 states and 438 transitions. [2018-10-01 00:41:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-01 00:41:25,918 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 286 [2018-10-01 00:41:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:25,920 INFO L225 Difference]: With dead ends: 435 [2018-10-01 00:41:25,920 INFO L226 Difference]: Without dead ends: 291 [2018-10-01 00:41:25,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-01 00:41:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-10-01 00:41:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-01 00:41:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2018-10-01 00:41:25,925 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 286 [2018-10-01 00:41:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:25,925 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 292 transitions. [2018-10-01 00:41:25,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-01 00:41:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 292 transitions. [2018-10-01 00:41:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-01 00:41:25,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:25,926 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1, 1, 1] [2018-10-01 00:41:25,926 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:25,927 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:25,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2112310263, now seen corresponding path program 71 times [2018-10-01 00:41:25,927 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:25,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:25,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:25,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:25,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 5112 trivial. 0 not checked. [2018-10-01 00:41:26,536 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:26,536 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:26,544 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:41:31,602 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-01 00:41:31,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:31,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 5112 trivial. 0 not checked. [2018-10-01 00:41:32,203 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:32,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-01 00:41:32,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-01 00:41:32,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-01 00:41:32,205 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:32,205 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. Second operand 74 states. [2018-10-01 00:41:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:33,728 INFO L93 Difference]: Finished difference Result 441 states and 444 transitions. [2018-10-01 00:41:33,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-01 00:41:33,728 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 290 [2018-10-01 00:41:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:33,730 INFO L225 Difference]: With dead ends: 441 [2018-10-01 00:41:33,731 INFO L226 Difference]: Without dead ends: 295 [2018-10-01 00:41:33,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:41:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-01 00:41:33,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-10-01 00:41:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-01 00:41:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-10-01 00:41:33,736 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 290 [2018-10-01 00:41:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:33,736 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-10-01 00:41:33,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-01 00:41:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-10-01 00:41:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-01 00:41:33,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:33,738 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1, 1, 1] [2018-10-01 00:41:33,739 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:33,739 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:33,739 INFO L82 PathProgramCache]: Analyzing trace with hash 532431979, now seen corresponding path program 72 times [2018-10-01 00:41:33,739 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:33,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:33,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:33,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:33,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2018-10-01 00:41:34,225 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:34,225 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:34,232 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:41:37,105 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-01 00:41:37,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:37,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:37,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2018-10-01 00:41:37,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:37,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-01 00:41:37,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-01 00:41:37,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-01 00:41:37,483 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:37,483 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 75 states. [2018-10-01 00:41:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:38,868 INFO L93 Difference]: Finished difference Result 447 states and 450 transitions. [2018-10-01 00:41:38,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-01 00:41:38,868 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 294 [2018-10-01 00:41:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:38,870 INFO L225 Difference]: With dead ends: 447 [2018-10-01 00:41:38,870 INFO L226 Difference]: Without dead ends: 299 [2018-10-01 00:41:38,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:41:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-01 00:41:38,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-10-01 00:41:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-01 00:41:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-10-01 00:41:38,878 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 294 [2018-10-01 00:41:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:38,878 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-10-01 00:41:38,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-01 00:41:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-10-01 00:41:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-01 00:41:38,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:38,880 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1, 1, 1] [2018-10-01 00:41:38,880 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:38,880 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash -737967393, now seen corresponding path program 73 times [2018-10-01 00:41:38,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:38,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:38,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:38,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:38,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-01 00:41:39,348 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:39,349 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:39,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:39,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-01 00:41:39,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:39,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-01 00:41:39,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-01 00:41:39,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-01 00:41:39,797 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:39,797 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 76 states. [2018-10-01 00:41:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:41,248 INFO L93 Difference]: Finished difference Result 453 states and 456 transitions. [2018-10-01 00:41:41,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-01 00:41:41,249 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 298 [2018-10-01 00:41:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:41,251 INFO L225 Difference]: With dead ends: 453 [2018-10-01 00:41:41,251 INFO L226 Difference]: Without dead ends: 303 [2018-10-01 00:41:41,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-01 00:41:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-10-01 00:41:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-01 00:41:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-10-01 00:41:41,256 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 298 [2018-10-01 00:41:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:41,256 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-10-01 00:41:41,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-01 00:41:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-10-01 00:41:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-01 00:41:41,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:41,258 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1, 1, 1] [2018-10-01 00:41:41,258 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:41,258 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:41,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1203898195, now seen corresponding path program 74 times [2018-10-01 00:41:41,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:41,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:41,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:41,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:41,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2018-10-01 00:41:41,929 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:41,929 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:41,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:41:42,057 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:41:42,057 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:42,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2018-10-01 00:41:42,389 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:42,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-01 00:41:42,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-01 00:41:42,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-01 00:41:42,390 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:42,390 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 77 states. [2018-10-01 00:41:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:43,869 INFO L93 Difference]: Finished difference Result 459 states and 462 transitions. [2018-10-01 00:41:43,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-01 00:41:43,869 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 302 [2018-10-01 00:41:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:43,871 INFO L225 Difference]: With dead ends: 459 [2018-10-01 00:41:43,871 INFO L226 Difference]: Without dead ends: 307 [2018-10-01 00:41:43,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:41:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-01 00:41:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-10-01 00:41:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-01 00:41:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-10-01 00:41:43,876 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 302 [2018-10-01 00:41:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:43,876 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-10-01 00:41:43,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-01 00:41:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-10-01 00:41:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-01 00:41:43,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:43,878 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1, 1, 1] [2018-10-01 00:41:43,878 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:43,878 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1753427513, now seen corresponding path program 75 times [2018-10-01 00:41:43,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:43,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:43,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:43,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:43,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2018-10-01 00:41:44,359 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:44,359 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:44,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:48,945 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-01 00:41:48,946 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:48,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2018-10-01 00:41:49,276 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:49,276 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-01 00:41:49,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-01 00:41:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-01 00:41:49,277 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:49,277 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 78 states. [2018-10-01 00:41:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:50,970 INFO L93 Difference]: Finished difference Result 465 states and 468 transitions. [2018-10-01 00:41:50,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-01 00:41:50,971 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 306 [2018-10-01 00:41:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:50,972 INFO L225 Difference]: With dead ends: 465 [2018-10-01 00:41:50,972 INFO L226 Difference]: Without dead ends: 311 [2018-10-01 00:41:50,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-01 00:41:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-10-01 00:41:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-01 00:41:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-10-01 00:41:50,976 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 306 [2018-10-01 00:41:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:50,977 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-10-01 00:41:50,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-01 00:41:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-10-01 00:41:50,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-01 00:41:50,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:50,978 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1, 1, 1] [2018-10-01 00:41:50,978 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:50,978 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:50,979 INFO L82 PathProgramCache]: Analyzing trace with hash 255386171, now seen corresponding path program 76 times [2018-10-01 00:41:50,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:50,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:50,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:50,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:50,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 5852 trivial. 0 not checked. [2018-10-01 00:41:51,455 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:51,455 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:51,462 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:51,587 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:51,587 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:51,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 5852 trivial. 0 not checked. [2018-10-01 00:41:52,139 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:52,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-01 00:41:52,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-01 00:41:52,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-01 00:41:52,141 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:52,141 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 79 states. [2018-10-01 00:41:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:53,873 INFO L93 Difference]: Finished difference Result 471 states and 474 transitions. [2018-10-01 00:41:53,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-01 00:41:53,874 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 310 [2018-10-01 00:41:53,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:53,875 INFO L225 Difference]: With dead ends: 471 [2018-10-01 00:41:53,875 INFO L226 Difference]: Without dead ends: 315 [2018-10-01 00:41:53,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:41:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-01 00:41:53,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-10-01 00:41:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-01 00:41:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-10-01 00:41:53,881 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 310 [2018-10-01 00:41:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:53,882 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-10-01 00:41:53,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-01 00:41:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-10-01 00:41:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-01 00:41:53,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:53,884 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1, 1, 1] [2018-10-01 00:41:53,884 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:53,884 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:53,884 INFO L82 PathProgramCache]: Analyzing trace with hash -361023313, now seen corresponding path program 77 times [2018-10-01 00:41:53,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:53,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:53,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:53,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:53,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2018-10-01 00:41:54,391 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:54,391 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:54,398 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:42:03,534 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-10-01 00:42:03,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:03,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2018-10-01 00:42:03,864 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:03,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-01 00:42:03,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-01 00:42:03,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-01 00:42:03,865 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:03,866 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 80 states. [2018-10-01 00:42:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:05,579 INFO L93 Difference]: Finished difference Result 477 states and 480 transitions. [2018-10-01 00:42:05,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-01 00:42:05,580 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 314 [2018-10-01 00:42:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:05,581 INFO L225 Difference]: With dead ends: 477 [2018-10-01 00:42:05,582 INFO L226 Difference]: Without dead ends: 319 [2018-10-01 00:42:05,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:42:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-01 00:42:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-10-01 00:42:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-01 00:42:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-10-01 00:42:05,587 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 314 [2018-10-01 00:42:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:05,587 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-10-01 00:42:05,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-01 00:42:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-10-01 00:42:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-01 00:42:05,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:05,588 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1, 1, 1] [2018-10-01 00:42:05,589 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:05,589 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:05,589 INFO L82 PathProgramCache]: Analyzing trace with hash 340317475, now seen corresponding path program 78 times [2018-10-01 00:42:05,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:05,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:05,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:05,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:05,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 6162 trivial. 0 not checked. [2018-10-01 00:42:06,110 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:06,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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:06,118 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:42:09,603 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-10-01 00:42:09,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:09,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 6162 trivial. 0 not checked. [2018-10-01 00:42:09,947 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:09,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-01 00:42:09,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-01 00:42:09,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-01 00:42:09,948 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:09,949 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 81 states. [2018-10-01 00:42:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:11,524 INFO L93 Difference]: Finished difference Result 483 states and 486 transitions. [2018-10-01 00:42:11,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-01 00:42:11,524 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 318 [2018-10-01 00:42:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:11,526 INFO L225 Difference]: With dead ends: 483 [2018-10-01 00:42:11,526 INFO L226 Difference]: Without dead ends: 323 [2018-10-01 00:42:11,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:42:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-01 00:42:11,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-10-01 00:42:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-01 00:42:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 324 transitions. [2018-10-01 00:42:11,532 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 324 transitions. Word has length 318 [2018-10-01 00:42:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:11,532 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 324 transitions. [2018-10-01 00:42:11,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-01 00:42:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 324 transitions. [2018-10-01 00:42:11,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-01 00:42:11,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:11,534 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1, 1, 1] [2018-10-01 00:42:11,534 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:11,534 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:11,534 INFO L82 PathProgramCache]: Analyzing trace with hash -416893033, now seen corresponding path program 79 times [2018-10-01 00:42:11,534 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:11,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:11,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:11,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:11,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 6320 trivial. 0 not checked. [2018-10-01 00:42:12,112 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:12,112 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:12,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:12,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 6320 trivial. 0 not checked. [2018-10-01 00:42:12,706 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:12,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-01 00:42:12,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-01 00:42:12,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-01 00:42:12,707 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:12,707 INFO L87 Difference]: Start difference. First operand 323 states and 324 transitions. Second operand 82 states. [2018-10-01 00:42:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:14,691 INFO L93 Difference]: Finished difference Result 489 states and 492 transitions. [2018-10-01 00:42:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-01 00:42:14,691 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 322 [2018-10-01 00:42:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:14,693 INFO L225 Difference]: With dead ends: 489 [2018-10-01 00:42:14,693 INFO L226 Difference]: Without dead ends: 327 [2018-10-01 00:42:14,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:42:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-01 00:42:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-10-01 00:42:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-01 00:42:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-10-01 00:42:14,698 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 322 [2018-10-01 00:42:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:14,698 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-10-01 00:42:14,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-01 00:42:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-10-01 00:42:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-01 00:42:14,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:14,700 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1, 1, 1] [2018-10-01 00:42:14,700 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:14,700 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:14,700 INFO L82 PathProgramCache]: Analyzing trace with hash -317071349, now seen corresponding path program 80 times [2018-10-01 00:42:14,700 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:14,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:14,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:14,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:14,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2018-10-01 00:42:15,228 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:15,228 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:15,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:42:15,362 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:42:15,363 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:15,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2018-10-01 00:42:15,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:15,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-10-01 00:42:15,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-01 00:42:15,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-01 00:42:15,706 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:15,706 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 83 states. [2018-10-01 00:42:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:17,814 INFO L93 Difference]: Finished difference Result 495 states and 498 transitions. [2018-10-01 00:42:17,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-01 00:42:17,815 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 326 [2018-10-01 00:42:17,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:17,816 INFO L225 Difference]: With dead ends: 495 [2018-10-01 00:42:17,817 INFO L226 Difference]: Without dead ends: 331 [2018-10-01 00:42:17,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:42:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-01 00:42:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-10-01 00:42:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-01 00:42:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 332 transitions. [2018-10-01 00:42:17,822 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 332 transitions. Word has length 326 [2018-10-01 00:42:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:17,822 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 332 transitions. [2018-10-01 00:42:17,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-01 00:42:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 332 transitions. [2018-10-01 00:42:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-01 00:42:17,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:17,823 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1, 1, 1] [2018-10-01 00:42:17,823 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:17,824 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:17,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1616425345, now seen corresponding path program 81 times [2018-10-01 00:42:17,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:17,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:17,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:17,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 6642 trivial. 0 not checked. [2018-10-01 00:42:18,359 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:18,360 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:18,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:42:24,738 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-10-01 00:42:24,738 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:24,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 6642 trivial. 0 not checked. [2018-10-01 00:42:25,089 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:25,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-10-01 00:42:25,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-01 00:42:25,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-01 00:42:25,090 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:25,090 INFO L87 Difference]: Start difference. First operand 331 states and 332 transitions. Second operand 84 states. [2018-10-01 00:42:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:26,818 INFO L93 Difference]: Finished difference Result 501 states and 504 transitions. [2018-10-01 00:42:26,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-01 00:42:26,819 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 330 [2018-10-01 00:42:26,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:26,820 INFO L225 Difference]: With dead ends: 501 [2018-10-01 00:42:26,820 INFO L226 Difference]: Without dead ends: 335 [2018-10-01 00:42:26,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:42:26,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-01 00:42:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-10-01 00:42:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-01 00:42:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-10-01 00:42:26,825 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 330 [2018-10-01 00:42:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:26,825 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-10-01 00:42:26,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-01 00:42:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-10-01 00:42:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-01 00:42:26,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:26,827 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1, 1, 1] [2018-10-01 00:42:26,827 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:26,827 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:26,827 INFO L82 PathProgramCache]: Analyzing trace with hash 668205811, now seen corresponding path program 82 times [2018-10-01 00:42:26,827 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:26,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:26,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:26,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:26,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 6806 trivial. 0 not checked. [2018-10-01 00:42:27,383 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:27,383 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:27,392 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:42:27,525 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:42:27,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:27,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 6806 trivial. 0 not checked. [2018-10-01 00:42:27,998 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:27,999 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-10-01 00:42:27,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-01 00:42:28,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-01 00:42:28,000 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:28,000 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 85 states. [2018-10-01 00:42:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:30,265 INFO L93 Difference]: Finished difference Result 507 states and 510 transitions. [2018-10-01 00:42:30,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-01 00:42:30,265 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 334 [2018-10-01 00:42:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:30,266 INFO L225 Difference]: With dead ends: 507 [2018-10-01 00:42:30,267 INFO L226 Difference]: Without dead ends: 339 [2018-10-01 00:42:30,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:42:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-01 00:42:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-10-01 00:42:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-01 00:42:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-10-01 00:42:30,271 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 334 [2018-10-01 00:42:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:30,272 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-10-01 00:42:30,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-01 00:42:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-10-01 00:42:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-01 00:42:30,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:30,273 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1, 1, 1] [2018-10-01 00:42:30,273 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:30,273 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:30,274 INFO L82 PathProgramCache]: Analyzing trace with hash 505740647, now seen corresponding path program 83 times [2018-10-01 00:42:30,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:30,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:30,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:30,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:30,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 6972 trivial. 0 not checked. [2018-10-01 00:42:30,816 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:30,816 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:30,824 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:42:39,961 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-10-01 00:42:39,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:39,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 6972 trivial. 0 not checked. [2018-10-01 00:42:40,320 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:40,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-10-01 00:42:40,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-01 00:42:40,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-01 00:42:40,321 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:40,321 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 86 states. [2018-10-01 00:42:42,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:42,443 INFO L93 Difference]: Finished difference Result 513 states and 516 transitions. [2018-10-01 00:42:42,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-01 00:42:42,443 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 338 [2018-10-01 00:42:42,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:42,445 INFO L225 Difference]: With dead ends: 513 [2018-10-01 00:42:42,445 INFO L226 Difference]: Without dead ends: 343 [2018-10-01 00:42:42,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:42:42,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-01 00:42:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-10-01 00:42:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-01 00:42:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-10-01 00:42:42,449 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 338 [2018-10-01 00:42:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:42,450 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-10-01 00:42:42,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-01 00:42:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-10-01 00:42:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-01 00:42:42,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:42,451 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1, 1, 1] [2018-10-01 00:42:42,451 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:42,451 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:42,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1251950043, now seen corresponding path program 84 times [2018-10-01 00:42:42,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:42,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:42,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:42,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:42,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2018-10-01 00:42:43,292 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:43,292 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:43,301 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:42:47,987 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-10-01 00:42:47,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:48,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2018-10-01 00:42:48,608 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:48,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-10-01 00:42:48,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-01 00:42:48,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-01 00:42:48,609 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:48,609 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 87 states. [2018-10-01 00:42:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:50,821 INFO L93 Difference]: Finished difference Result 519 states and 522 transitions. [2018-10-01 00:42:50,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-01 00:42:50,821 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 342 [2018-10-01 00:42:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:50,823 INFO L225 Difference]: With dead ends: 519 [2018-10-01 00:42:50,823 INFO L226 Difference]: Without dead ends: 347 [2018-10-01 00:42:50,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:42:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-01 00:42:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-10-01 00:42:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-01 00:42:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-10-01 00:42:50,829 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 342 [2018-10-01 00:42:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:50,829 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-10-01 00:42:50,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-01 00:42:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-10-01 00:42:50,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-01 00:42:50,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:50,831 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1, 1, 1] [2018-10-01 00:42:50,831 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:50,831 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:50,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1690813519, now seen corresponding path program 85 times [2018-10-01 00:42:50,832 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:50,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:50,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:50,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:50,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 7310 trivial. 0 not checked. [2018-10-01 00:42:51,413 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:51,413 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:51,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:51,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 7310 trivial. 0 not checked. [2018-10-01 00:42:51,910 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:51,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2018-10-01 00:42:51,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-01 00:42:51,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-01 00:42:51,912 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:51,912 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 88 states. [2018-10-01 00:42:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:54,138 INFO L93 Difference]: Finished difference Result 525 states and 528 transitions. [2018-10-01 00:42:54,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-01 00:42:54,138 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 346 [2018-10-01 00:42:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:54,139 INFO L225 Difference]: With dead ends: 525 [2018-10-01 00:42:54,140 INFO L226 Difference]: Without dead ends: 351 [2018-10-01 00:42:54,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:42:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-01 00:42:54,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-10-01 00:42:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-01 00:42:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-10-01 00:42:54,145 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 346 [2018-10-01 00:42:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:54,146 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-10-01 00:42:54,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-01 00:42:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-10-01 00:42:54,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-01 00:42:54,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:54,147 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1, 1, 1] [2018-10-01 00:42:54,147 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:54,147 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:54,148 INFO L82 PathProgramCache]: Analyzing trace with hash -744255293, now seen corresponding path program 86 times [2018-10-01 00:42:54,148 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:54,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:54,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:54,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:54,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 7482 trivial. 0 not checked. [2018-10-01 00:42:54,744 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:54,744 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:54,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:42:54,888 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:42:54,888 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:54,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 7482 trivial. 0 not checked. [2018-10-01 00:42:55,259 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:55,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2018-10-01 00:42:55,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-01 00:42:55,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-01 00:42:55,261 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:55,261 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 89 states. [2018-10-01 00:42:57,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:57,178 INFO L93 Difference]: Finished difference Result 531 states and 534 transitions. [2018-10-01 00:42:57,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-01 00:42:57,178 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 350 [2018-10-01 00:42:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:57,180 INFO L225 Difference]: With dead ends: 531 [2018-10-01 00:42:57,180 INFO L226 Difference]: Without dead ends: 355 [2018-10-01 00:42:57,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:42:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-01 00:42:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-10-01 00:42:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-01 00:42:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-10-01 00:42:57,185 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 350 [2018-10-01 00:42:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:57,185 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-10-01 00:42:57,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-01 00:42:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-10-01 00:42:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-01 00:42:57,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:57,187 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1, 1, 1] [2018-10-01 00:42:57,187 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:57,187 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:57,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1840751415, now seen corresponding path program 87 times [2018-10-01 00:42:57,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:57,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:57,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:57,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:57,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 15312 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 7656 trivial. 0 not checked. [2018-10-01 00:42:57,782 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:57,782 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:57,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:43:05,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-10-01 00:43:05,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:05,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15312 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 7656 trivial. 0 not checked. [2018-10-01 00:43:06,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:06,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-10-01 00:43:06,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-01 00:43:06,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-01 00:43:06,250 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:06,250 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 90 states. [2018-10-01 00:43:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:08,331 INFO L93 Difference]: Finished difference Result 537 states and 540 transitions. [2018-10-01 00:43:08,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-01 00:43:08,332 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 354 [2018-10-01 00:43:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:08,333 INFO L225 Difference]: With dead ends: 537 [2018-10-01 00:43:08,333 INFO L226 Difference]: Without dead ends: 359 [2018-10-01 00:43:08,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:43:08,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-01 00:43:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-10-01 00:43:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-01 00:43:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-10-01 00:43:08,338 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 354 [2018-10-01 00:43:08,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:08,339 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-10-01 00:43:08,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-01 00:43:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-10-01 00:43:08,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-01 00:43:08,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:08,340 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1, 1, 1] [2018-10-01 00:43:08,340 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:08,341 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:08,341 INFO L82 PathProgramCache]: Analyzing trace with hash 956890027, now seen corresponding path program 88 times [2018-10-01 00:43:08,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:08,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:08,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:08,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:08,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 7832 trivial. 0 not checked. [2018-10-01 00:43:09,085 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:09,086 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:09,092 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:43:09,236 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:43:09,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:09,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 7832 trivial. 0 not checked. [2018-10-01 00:43:09,611 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:09,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2018-10-01 00:43:09,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-01 00:43:09,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-01 00:43:09,613 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:09,613 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 91 states. [2018-10-01 00:43:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:12,036 INFO L93 Difference]: Finished difference Result 543 states and 546 transitions. [2018-10-01 00:43:12,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-01 00:43:12,037 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 358 [2018-10-01 00:43:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:12,038 INFO L225 Difference]: With dead ends: 543 [2018-10-01 00:43:12,038 INFO L226 Difference]: Without dead ends: 363 [2018-10-01 00:43:12,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:43:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-01 00:43:12,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-10-01 00:43:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-01 00:43:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 364 transitions. [2018-10-01 00:43:12,043 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 364 transitions. Word has length 358 [2018-10-01 00:43:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:12,043 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 364 transitions. [2018-10-01 00:43:12,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-01 00:43:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 364 transitions. [2018-10-01 00:43:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-01 00:43:12,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:12,045 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1, 1, 1] [2018-10-01 00:43:12,045 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:12,045 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash 723294751, now seen corresponding path program 89 times [2018-10-01 00:43:12,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:12,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:12,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:12,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:12,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 8010 trivial. 0 not checked. [2018-10-01 00:43:12,838 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:12,838 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:12,846 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:43:24,298 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2018-10-01 00:43:24,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:24,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 8010 trivial. 0 not checked. [2018-10-01 00:43:24,692 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:24,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2018-10-01 00:43:24,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-01 00:43:24,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-01 00:43:24,694 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:24,694 INFO L87 Difference]: Start difference. First operand 363 states and 364 transitions. Second operand 92 states. [2018-10-01 00:43:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:26,989 INFO L93 Difference]: Finished difference Result 549 states and 552 transitions. [2018-10-01 00:43:26,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-01 00:43:26,990 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 362 [2018-10-01 00:43:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:26,991 INFO L225 Difference]: With dead ends: 549 [2018-10-01 00:43:26,991 INFO L226 Difference]: Without dead ends: 367 [2018-10-01 00:43:26,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:43:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-01 00:43:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-10-01 00:43:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-01 00:43:26,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-10-01 00:43:26,996 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 362 [2018-10-01 00:43:26,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:26,997 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-10-01 00:43:26,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-01 00:43:26,997 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-10-01 00:43:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-01 00:43:26,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:26,998 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1, 1, 1] [2018-10-01 00:43:26,998 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:26,999 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:26,999 INFO L82 PathProgramCache]: Analyzing trace with hash -386433389, now seen corresponding path program 90 times [2018-10-01 00:43:26,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:26,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:27,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:27,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:27,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 8190 trivial. 0 not checked. [2018-10-01 00:43:27,594 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:27,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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:27,602 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:43:33,294 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2018-10-01 00:43:33,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:33,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 8190 trivial. 0 not checked. [2018-10-01 00:43:33,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:33,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2018-10-01 00:43:33,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-01 00:43:33,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-01 00:43:33,694 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:33,695 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 93 states. [2018-10-01 00:43:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:36,068 INFO L93 Difference]: Finished difference Result 555 states and 558 transitions. [2018-10-01 00:43:36,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-01 00:43:36,069 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 366 [2018-10-01 00:43:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:36,070 INFO L225 Difference]: With dead ends: 555 [2018-10-01 00:43:36,071 INFO L226 Difference]: Without dead ends: 371 [2018-10-01 00:43:36,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:43:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-01 00:43:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-10-01 00:43:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-01 00:43:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 372 transitions. [2018-10-01 00:43:36,076 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 372 transitions. Word has length 366 [2018-10-01 00:43:36,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:36,076 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 372 transitions. [2018-10-01 00:43:36,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-01 00:43:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 372 transitions. [2018-10-01 00:43:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-01 00:43:36,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:36,078 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1, 1, 1] [2018-10-01 00:43:36,078 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:36,078 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:36,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2028033785, now seen corresponding path program 91 times [2018-10-01 00:43:36,078 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:36,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:36,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:36,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:36,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 8372 trivial. 0 not checked. [2018-10-01 00:43:36,745 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:36,745 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:36,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:43:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:36,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 8372 trivial. 0 not checked. [2018-10-01 00:43:37,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:37,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2018-10-01 00:43:37,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-01 00:43:37,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-01 00:43:37,310 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:37,310 INFO L87 Difference]: Start difference. First operand 371 states and 372 transitions. Second operand 94 states. [2018-10-01 00:43:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:40,088 INFO L93 Difference]: Finished difference Result 561 states and 564 transitions. [2018-10-01 00:43:40,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-01 00:43:40,088 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 370 [2018-10-01 00:43:40,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:40,089 INFO L225 Difference]: With dead ends: 561 [2018-10-01 00:43:40,090 INFO L226 Difference]: Without dead ends: 375 [2018-10-01 00:43:40,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:43:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-01 00:43:40,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2018-10-01 00:43:40,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-01 00:43:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2018-10-01 00:43:40,095 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 370 [2018-10-01 00:43:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:40,095 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2018-10-01 00:43:40,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-01 00:43:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2018-10-01 00:43:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-01 00:43:40,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:40,096 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1, 1, 1] [2018-10-01 00:43:40,097 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:40,097 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:40,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1234639227, now seen corresponding path program 92 times [2018-10-01 00:43:40,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:40,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:40,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:40,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:43:40,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 8556 trivial. 0 not checked. [2018-10-01 00:43:40,714 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:40,714 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:40,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:43:40,888 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:43:40,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:40,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 8556 trivial. 0 not checked. [2018-10-01 00:43:41,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:41,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2018-10-01 00:43:41,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-01 00:43:41,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-01 00:43:41,282 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:41,283 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 95 states. [2018-10-01 00:43:43,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:43,498 INFO L93 Difference]: Finished difference Result 567 states and 570 transitions. [2018-10-01 00:43:43,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-01 00:43:43,499 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 374 [2018-10-01 00:43:43,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:43,500 INFO L225 Difference]: With dead ends: 567 [2018-10-01 00:43:43,500 INFO L226 Difference]: Without dead ends: 379 [2018-10-01 00:43:43,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:43:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-01 00:43:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-10-01 00:43:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-01 00:43:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 380 transitions. [2018-10-01 00:43:43,507 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 380 transitions. Word has length 374 [2018-10-01 00:43:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:43,507 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 380 transitions. [2018-10-01 00:43:43,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-01 00:43:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 380 transitions. [2018-10-01 00:43:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-01 00:43:43,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:43,508 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1, 1, 1] [2018-10-01 00:43:43,509 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:43,509 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:43,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1676005359, now seen corresponding path program 93 times [2018-10-01 00:43:43,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:43,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:43,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:43,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:43,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 8742 trivial. 0 not checked. [2018-10-01 00:43:44,168 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:44,168 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:44,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:43:54,324 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2018-10-01 00:43:54,325 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:54,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 8742 trivial. 0 not checked. [2018-10-01 00:43:54,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:54,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2018-10-01 00:43:54,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-01 00:43:54,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-01 00:43:54,896 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:54,896 INFO L87 Difference]: Start difference. First operand 379 states and 380 transitions. Second operand 96 states. [2018-10-01 00:43:57,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:57,330 INFO L93 Difference]: Finished difference Result 573 states and 576 transitions. [2018-10-01 00:43:57,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-01 00:43:57,331 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 378 [2018-10-01 00:43:57,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:57,332 INFO L225 Difference]: With dead ends: 573 [2018-10-01 00:43:57,332 INFO L226 Difference]: Without dead ends: 383 [2018-10-01 00:43:57,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:43:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-01 00:43:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-10-01 00:43:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-01 00:43:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-10-01 00:43:57,337 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 378 [2018-10-01 00:43:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:57,338 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-10-01 00:43:57,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-01 00:43:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-10-01 00:43:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-01 00:43:57,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:57,339 INFO L375 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1, 1, 1] [2018-10-01 00:43:57,339 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:57,340 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:57,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1190146973, now seen corresponding path program 94 times [2018-10-01 00:43:57,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:57,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:57,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:57,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:57,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2018-10-01 00:43:58,004 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:58,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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:58,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:43:58,161 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:43:58,161 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:58,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2018-10-01 00:43:58,616 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:58,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2018-10-01 00:43:58,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-01 00:43:58,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-01 00:43:58,617 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:58,617 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 97 states. [2018-10-01 00:44:01,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:01,008 INFO L93 Difference]: Finished difference Result 579 states and 582 transitions. [2018-10-01 00:44:01,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-01 00:44:01,009 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 382 [2018-10-01 00:44:01,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:01,010 INFO L225 Difference]: With dead ends: 579 [2018-10-01 00:44:01,010 INFO L226 Difference]: Without dead ends: 387 [2018-10-01 00:44:01,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:44:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-01 00:44:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-10-01 00:44:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-01 00:44:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 388 transitions. [2018-10-01 00:44:01,016 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 388 transitions. Word has length 382 [2018-10-01 00:44:01,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:01,016 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 388 transitions. [2018-10-01 00:44:01,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-01 00:44:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 388 transitions. [2018-10-01 00:44:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-01 00:44:01,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:01,018 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1, 1, 1] [2018-10-01 00:44:01,018 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:01,018 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:01,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1684402473, now seen corresponding path program 95 times [2018-10-01 00:44:01,019 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:01,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:01,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:01,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:01,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 9120 trivial. 0 not checked. [2018-10-01 00:44:01,672 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:01,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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:01,680 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:44:18,183 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2018-10-01 00:44:18,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:18,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 9120 trivial. 0 not checked. [2018-10-01 00:44:18,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:18,630 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2018-10-01 00:44:18,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-01 00:44:18,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-01 00:44:18,631 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:18,631 INFO L87 Difference]: Start difference. First operand 387 states and 388 transitions. Second operand 98 states. [2018-10-01 00:44:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:21,611 INFO L93 Difference]: Finished difference Result 585 states and 588 transitions. [2018-10-01 00:44:21,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-01 00:44:21,612 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 386 [2018-10-01 00:44:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:21,613 INFO L225 Difference]: With dead ends: 585 [2018-10-01 00:44:21,613 INFO L226 Difference]: Without dead ends: 391 [2018-10-01 00:44:21,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:44:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-01 00:44:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-10-01 00:44:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-01 00:44:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2018-10-01 00:44:21,618 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 386 [2018-10-01 00:44:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:21,619 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2018-10-01 00:44:21,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-01 00:44:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2018-10-01 00:44:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-10-01 00:44:21,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:21,621 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1, 1, 1] [2018-10-01 00:44:21,621 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:21,621 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1920362677, now seen corresponding path program 96 times [2018-10-01 00:44:21,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:21,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:21,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:21,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:21,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 9312 trivial. 0 not checked. [2018-10-01 00:44:22,336 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:22,336 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:22,345 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:44:30,403 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2018-10-01 00:44:30,403 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:30,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 9312 trivial. 0 not checked. [2018-10-01 00:44:30,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:30,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2018-10-01 00:44:30,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-01 00:44:30,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-01 00:44:30,983 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:30,983 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 99 states. [2018-10-01 00:44:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:34,068 INFO L93 Difference]: Finished difference Result 591 states and 594 transitions. [2018-10-01 00:44:34,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-01 00:44:34,069 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 390 [2018-10-01 00:44:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:34,070 INFO L225 Difference]: With dead ends: 591 [2018-10-01 00:44:34,071 INFO L226 Difference]: Without dead ends: 395 [2018-10-01 00:44:34,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:44:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-01 00:44:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-01 00:44:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-01 00:44:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 396 transitions. [2018-10-01 00:44:34,076 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 396 transitions. Word has length 390 [2018-10-01 00:44:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:34,076 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 396 transitions. [2018-10-01 00:44:34,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-01 00:44:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 396 transitions. [2018-10-01 00:44:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-01 00:44:34,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:34,078 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1, 1, 1] [2018-10-01 00:44:34,078 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:34,078 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:34,078 INFO L82 PathProgramCache]: Analyzing trace with hash 6514111, now seen corresponding path program 97 times [2018-10-01 00:44:34,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:34,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:34,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:34,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:34,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 9506 trivial. 0 not checked. [2018-10-01 00:44:34,775 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:34,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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:34,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:44:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:34,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 9506 trivial. 0 not checked. [2018-10-01 00:44:35,352 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:35,353 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2018-10-01 00:44:35,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-01 00:44:35,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-01 00:44:35,354 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:35,354 INFO L87 Difference]: Start difference. First operand 395 states and 396 transitions. Second operand 100 states. [2018-10-01 00:44:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:38,781 INFO L93 Difference]: Finished difference Result 597 states and 600 transitions. [2018-10-01 00:44:38,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-01 00:44:38,781 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 394 [2018-10-01 00:44:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:38,783 INFO L225 Difference]: With dead ends: 597 [2018-10-01 00:44:38,783 INFO L226 Difference]: Without dead ends: 399 [2018-10-01 00:44:38,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:44:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-01 00:44:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-10-01 00:44:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-01 00:44:38,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-10-01 00:44:38,789 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 394 [2018-10-01 00:44:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:38,789 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-10-01 00:44:38,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-01 00:44:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-10-01 00:44:38,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-01 00:44:38,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:38,791 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1, 1, 1] [2018-10-01 00:44:38,791 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:38,791 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:38,791 INFO L82 PathProgramCache]: Analyzing trace with hash 355236403, now seen corresponding path program 98 times [2018-10-01 00:44:38,791 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:38,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:38,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:38,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:44:38,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2018-10-01 00:44:39,483 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:39,483 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:39,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:44:39,648 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:44:39,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:39,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2018-10-01 00:44:40,065 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:40,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2018-10-01 00:44:40,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-01 00:44:40,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-01 00:44:40,066 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:40,067 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 101 states. [2018-10-01 00:44:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:43,397 INFO L93 Difference]: Finished difference Result 603 states and 606 transitions. [2018-10-01 00:44:43,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-01 00:44:43,398 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 398 [2018-10-01 00:44:43,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:43,399 INFO L225 Difference]: With dead ends: 603 [2018-10-01 00:44:43,399 INFO L226 Difference]: Without dead ends: 403 [2018-10-01 00:44:43,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:44:43,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-01 00:44:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-01 00:44:43,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-01 00:44:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 404 transitions. [2018-10-01 00:44:43,405 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 404 transitions. Word has length 398 [2018-10-01 00:44:43,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:43,405 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 404 transitions. [2018-10-01 00:44:43,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-01 00:44:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 404 transitions. [2018-10-01 00:44:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-01 00:44:43,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:43,407 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1, 1, 1] [2018-10-01 00:44:43,407 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:43,407 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1550439591, now seen corresponding path program 99 times [2018-10-01 00:44:43,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:43,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:43,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:43,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:43,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2018-10-01 00:44:44,104 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:44,104 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:44,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:44:57,569 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-10-01 00:44:57,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:57,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2018-10-01 00:44:58,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:58,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2018-10-01 00:44:58,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-01 00:44:58,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-01 00:44:58,009 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:58,010 INFO L87 Difference]: Start difference. First operand 403 states and 404 transitions. Second operand 102 states. [2018-10-01 00:45:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:01,551 INFO L93 Difference]: Finished difference Result 609 states and 612 transitions. [2018-10-01 00:45:01,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-01 00:45:01,551 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 402 [2018-10-01 00:45:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:01,553 INFO L225 Difference]: With dead ends: 609 [2018-10-01 00:45:01,553 INFO L226 Difference]: Without dead ends: 407 [2018-10-01 00:45:01,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:45:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-01 00:45:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2018-10-01 00:45:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-10-01 00:45:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2018-10-01 00:45:01,558 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 402 [2018-10-01 00:45:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:01,559 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2018-10-01 00:45:01,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-01 00:45:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2018-10-01 00:45:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-01 00:45:01,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:01,561 INFO L375 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1, 1, 1] [2018-10-01 00:45:01,561 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:01,561 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:01,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1776257765, now seen corresponding path program 100 times [2018-10-01 00:45:01,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:01,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:01,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:01,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 10100 trivial. 0 not checked. [2018-10-01 00:45:02,538 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:02,538 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:02,545 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:45:02,706 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:45:02,706 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:02,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 10100 trivial. 0 not checked. [2018-10-01 00:45:03,202 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:03,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2018-10-01 00:45:03,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-01 00:45:03,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-01 00:45:03,203 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:03,203 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 103 states. [2018-10-01 00:45:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:06,646 INFO L93 Difference]: Finished difference Result 615 states and 618 transitions. [2018-10-01 00:45:06,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-01 00:45:06,647 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 406 [2018-10-01 00:45:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:06,648 INFO L225 Difference]: With dead ends: 615 [2018-10-01 00:45:06,648 INFO L226 Difference]: Without dead ends: 411 [2018-10-01 00:45:06,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:45:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-10-01 00:45:06,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-10-01 00:45:06,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-01 00:45:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 412 transitions. [2018-10-01 00:45:06,656 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 412 transitions. Word has length 406 [2018-10-01 00:45:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:06,656 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 412 transitions. [2018-10-01 00:45:06,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-01 00:45:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 412 transitions. [2018-10-01 00:45:06,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-01 00:45:06,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:06,658 INFO L375 BasicCegarLoop]: trace histogram [102, 102, 101, 101, 1, 1, 1, 1] [2018-10-01 00:45:06,659 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:06,659 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:06,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1909808015, now seen corresponding path program 101 times [2018-10-01 00:45:06,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:06,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:06,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:06,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:06,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 10302 trivial. 0 not checked. [2018-10-01 00:45:07,427 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:07,427 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:07,434 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:45:29,144 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2018-10-01 00:45:29,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:29,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 10302 trivial. 0 not checked. [2018-10-01 00:45:29,673 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:29,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2018-10-01 00:45:29,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-01 00:45:29,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-01 00:45:29,675 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:29,675 INFO L87 Difference]: Start difference. First operand 411 states and 412 transitions. Second operand 104 states. [2018-10-01 00:45:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:33,568 INFO L93 Difference]: Finished difference Result 621 states and 624 transitions. [2018-10-01 00:45:33,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-01 00:45:33,568 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 410 [2018-10-01 00:45:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:33,570 INFO L225 Difference]: With dead ends: 621 [2018-10-01 00:45:33,570 INFO L226 Difference]: Without dead ends: 415 [2018-10-01 00:45:33,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:45:33,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-01 00:45:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2018-10-01 00:45:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-10-01 00:45:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-10-01 00:45:33,578 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 410 [2018-10-01 00:45:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:33,578 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-10-01 00:45:33,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-01 00:45:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-10-01 00:45:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-01 00:45:33,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:33,581 INFO L375 BasicCegarLoop]: trace histogram [103, 103, 102, 102, 1, 1, 1, 1] [2018-10-01 00:45:33,581 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:33,581 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:33,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1317898243, now seen corresponding path program 102 times [2018-10-01 00:45:33,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:33,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:33,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:33,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:33,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 10506 trivial. 0 not checked. [2018-10-01 00:45:34,346 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:34,346 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:34,354 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:45:44,324 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 103 check-sat command(s) [2018-10-01 00:45:44,324 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:44,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 10506 trivial. 0 not checked. [2018-10-01 00:45:44,793 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:44,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2018-10-01 00:45:44,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-01 00:45:44,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-01 00:45:44,795 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:44,795 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 105 states. [2018-10-01 00:45:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:48,126 INFO L93 Difference]: Finished difference Result 627 states and 630 transitions. [2018-10-01 00:45:48,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-01 00:45:48,126 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 414 [2018-10-01 00:45:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:48,127 INFO L225 Difference]: With dead ends: 627 [2018-10-01 00:45:48,127 INFO L226 Difference]: Without dead ends: 419 [2018-10-01 00:45:48,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:45:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-01 00:45:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2018-10-01 00:45:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-01 00:45:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 420 transitions. [2018-10-01 00:45:48,135 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 420 transitions. Word has length 414 [2018-10-01 00:45:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:48,135 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 420 transitions. [2018-10-01 00:45:48,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-01 00:45:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 420 transitions. [2018-10-01 00:45:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-01 00:45:48,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:48,138 INFO L375 BasicCegarLoop]: trace histogram [104, 104, 103, 103, 1, 1, 1, 1] [2018-10-01 00:45:48,138 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:48,138 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:48,138 INFO L82 PathProgramCache]: Analyzing trace with hash -87164297, now seen corresponding path program 103 times [2018-10-01 00:45:48,138 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:48,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:48,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:48,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:48,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 10712 trivial. 0 not checked. [2018-10-01 00:45:48,912 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:48,912 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:48,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:45:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:49,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 10712 trivial. 0 not checked. [2018-10-01 00:45:49,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:49,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2018-10-01 00:45:49,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-01 00:45:49,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-01 00:45:49,553 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:49,553 INFO L87 Difference]: Start difference. First operand 419 states and 420 transitions. Second operand 106 states. [2018-10-01 00:45:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:52,743 INFO L93 Difference]: Finished difference Result 633 states and 636 transitions. [2018-10-01 00:45:52,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-01 00:45:52,744 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 418 [2018-10-01 00:45:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:52,745 INFO L225 Difference]: With dead ends: 633 [2018-10-01 00:45:52,745 INFO L226 Difference]: Without dead ends: 423 [2018-10-01 00:45:52,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:45:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-01 00:45:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-10-01 00:45:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-01 00:45:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2018-10-01 00:45:52,753 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 418 [2018-10-01 00:45:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:52,753 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2018-10-01 00:45:52,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-01 00:45:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2018-10-01 00:45:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-01 00:45:52,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:52,756 INFO L375 BasicCegarLoop]: trace histogram [105, 105, 104, 104, 1, 1, 1, 1] [2018-10-01 00:45:52,756 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:52,757 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:52,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1956360939, now seen corresponding path program 104 times [2018-10-01 00:45:52,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:52,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:52,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:52,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:45:52,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:53,522 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 10920 trivial. 0 not checked. [2018-10-01 00:45:53,523 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:53,523 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:53,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:45:53,716 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:45:53,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:53,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 10920 trivial. 0 not checked. [2018-10-01 00:45:54,191 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:54,191 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2018-10-01 00:45:54,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-01 00:45:54,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-01 00:45:54,193 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:54,193 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 107 states. [2018-10-01 00:45:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:57,733 INFO L93 Difference]: Finished difference Result 639 states and 642 transitions. [2018-10-01 00:45:57,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-01 00:45:57,734 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 422 [2018-10-01 00:45:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:57,735 INFO L225 Difference]: With dead ends: 639 [2018-10-01 00:45:57,735 INFO L226 Difference]: Without dead ends: 427 [2018-10-01 00:45:57,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:45:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-01 00:45:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-10-01 00:45:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-01 00:45:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 428 transitions. [2018-10-01 00:45:57,741 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 428 transitions. Word has length 422 [2018-10-01 00:45:57,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:57,741 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 428 transitions. [2018-10-01 00:45:57,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-01 00:45:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 428 transitions. [2018-10-01 00:45:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-10-01 00:45:57,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:57,743 INFO L375 BasicCegarLoop]: trace histogram [106, 106, 105, 105, 1, 1, 1, 1] [2018-10-01 00:45:57,743 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:57,743 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:57,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1451511457, now seen corresponding path program 105 times [2018-10-01 00:45:57,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:57,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:57,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:57,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:57,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 11130 trivial. 0 not checked. [2018-10-01 00:45:58,507 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:58,507 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:58,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:46:15,588 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2018-10-01 00:46:15,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:15,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 11130 trivial. 0 not checked. [2018-10-01 00:46:16,071 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:16,071 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2018-10-01 00:46:16,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-01 00:46:16,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-01 00:46:16,072 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:16,072 INFO L87 Difference]: Start difference. First operand 427 states and 428 transitions. Second operand 108 states. [2018-10-01 00:46:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:20,328 INFO L93 Difference]: Finished difference Result 645 states and 648 transitions. [2018-10-01 00:46:20,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-01 00:46:20,328 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 426 [2018-10-01 00:46:20,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:20,329 INFO L225 Difference]: With dead ends: 645 [2018-10-01 00:46:20,329 INFO L226 Difference]: Without dead ends: 431 [2018-10-01 00:46:20,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:46:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-01 00:46:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-10-01 00:46:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-01 00:46:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2018-10-01 00:46:20,334 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 426 [2018-10-01 00:46:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:20,335 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2018-10-01 00:46:20,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-01 00:46:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2018-10-01 00:46:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-01 00:46:20,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:20,336 INFO L375 BasicCegarLoop]: trace histogram [107, 107, 106, 106, 1, 1, 1, 1] [2018-10-01 00:46:20,336 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:20,336 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:20,337 INFO L82 PathProgramCache]: Analyzing trace with hash 913503699, now seen corresponding path program 106 times [2018-10-01 00:46:20,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:20,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:20,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:20,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:20,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 11342 trivial. 0 not checked. [2018-10-01 00:46:21,090 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:21,090 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:21,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:46:21,293 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:46:21,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:21,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 11342 trivial. 0 not checked. [2018-10-01 00:46:21,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:21,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2018-10-01 00:46:21,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-01 00:46:21,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-01 00:46:21,757 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:21,757 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 109 states. [2018-10-01 00:46:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:25,614 INFO L93 Difference]: Finished difference Result 651 states and 654 transitions. [2018-10-01 00:46:25,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-01 00:46:25,614 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 430 [2018-10-01 00:46:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:25,615 INFO L225 Difference]: With dead ends: 651 [2018-10-01 00:46:25,615 INFO L226 Difference]: Without dead ends: 435 [2018-10-01 00:46:25,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:46:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-10-01 00:46:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-10-01 00:46:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-01 00:46:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 436 transitions. [2018-10-01 00:46:25,621 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 436 transitions. Word has length 430 [2018-10-01 00:46:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:25,621 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 436 transitions. [2018-10-01 00:46:25,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-01 00:46:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 436 transitions. [2018-10-01 00:46:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-10-01 00:46:25,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:25,623 INFO L375 BasicCegarLoop]: trace histogram [108, 108, 107, 107, 1, 1, 1, 1] [2018-10-01 00:46:25,623 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:25,623 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:25,623 INFO L82 PathProgramCache]: Analyzing trace with hash 671514695, now seen corresponding path program 107 times [2018-10-01 00:46:25,623 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:25,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:25,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:25,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:25,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 11556 trivial. 0 not checked. [2018-10-01 00:46:26,746 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:26,746 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:26,754 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:47:01,436 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 108 check-sat command(s) [2018-10-01 00:47:01,436 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:01,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 11556 trivial. 0 not checked. [2018-10-01 00:47:01,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:01,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2018-10-01 00:47:01,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-01 00:47:01,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-01 00:47:01,942 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:01,942 INFO L87 Difference]: Start difference. First operand 435 states and 436 transitions. Second operand 110 states. [2018-10-01 00:47:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:06,060 INFO L93 Difference]: Finished difference Result 657 states and 660 transitions. [2018-10-01 00:47:06,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-01 00:47:06,061 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 434 [2018-10-01 00:47:06,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:06,062 INFO L225 Difference]: With dead ends: 657 [2018-10-01 00:47:06,062 INFO L226 Difference]: Without dead ends: 439 [2018-10-01 00:47:06,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:47:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-10-01 00:47:06,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2018-10-01 00:47:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-01 00:47:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-10-01 00:47:06,067 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 434 [2018-10-01 00:47:06,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:06,068 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-10-01 00:47:06,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-01 00:47:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-10-01 00:47:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-01 00:47:06,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:06,069 INFO L375 BasicCegarLoop]: trace histogram [109, 109, 108, 108, 1, 1, 1, 1] [2018-10-01 00:47:06,070 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:06,070 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:06,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1170517829, now seen corresponding path program 108 times [2018-10-01 00:47:06,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:06,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:06,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:06,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:06,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 11772 trivial. 0 not checked. [2018-10-01 00:47:06,886 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:06,886 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:06,894 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:47:22,674 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 109 check-sat command(s) [2018-10-01 00:47:22,675 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:22,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 11772 trivial. 0 not checked. [2018-10-01 00:47:23,203 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:23,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2018-10-01 00:47:23,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-01 00:47:23,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-01 00:47:23,205 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:23,205 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 111 states. [2018-10-01 00:47:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:28,355 INFO L93 Difference]: Finished difference Result 663 states and 666 transitions. [2018-10-01 00:47:28,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-01 00:47:28,356 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 438 [2018-10-01 00:47:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:28,356 INFO L225 Difference]: With dead ends: 663 [2018-10-01 00:47:28,357 INFO L226 Difference]: Without dead ends: 443 [2018-10-01 00:47:28,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:47:28,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-01 00:47:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-10-01 00:47:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-10-01 00:47:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 444 transitions. [2018-10-01 00:47:28,362 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 444 transitions. Word has length 438 [2018-10-01 00:47:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:28,362 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 444 transitions. [2018-10-01 00:47:28,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-01 00:47:28,362 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 444 transitions. [2018-10-01 00:47:28,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-10-01 00:47:28,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:28,364 INFO L375 BasicCegarLoop]: trace histogram [110, 110, 109, 109, 1, 1, 1, 1] [2018-10-01 00:47:28,364 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:28,364 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:28,364 INFO L82 PathProgramCache]: Analyzing trace with hash 412509999, now seen corresponding path program 109 times [2018-10-01 00:47:28,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:28,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:28,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:28,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:28,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 11990 trivial. 0 not checked. [2018-10-01 00:47:29,158 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:29,158 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:29,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:47:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:29,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 11990 trivial. 0 not checked. [2018-10-01 00:47:30,019 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:30,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2018-10-01 00:47:30,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-01 00:47:30,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-01 00:47:30,021 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:30,021 INFO L87 Difference]: Start difference. First operand 443 states and 444 transitions. Second operand 112 states. [2018-10-01 00:47:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:34,162 INFO L93 Difference]: Finished difference Result 669 states and 672 transitions. [2018-10-01 00:47:34,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-01 00:47:34,163 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 442 [2018-10-01 00:47:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:34,164 INFO L225 Difference]: With dead ends: 669 [2018-10-01 00:47:34,164 INFO L226 Difference]: Without dead ends: 447 [2018-10-01 00:47:34,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:47:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-01 00:47:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2018-10-01 00:47:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-10-01 00:47:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2018-10-01 00:47:34,171 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 442 [2018-10-01 00:47:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:34,171 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2018-10-01 00:47:34,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-01 00:47:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2018-10-01 00:47:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-10-01 00:47:34,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:34,173 INFO L375 BasicCegarLoop]: trace histogram [111, 111, 110, 110, 1, 1, 1, 1] [2018-10-01 00:47:34,173 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:34,173 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:34,173 INFO L82 PathProgramCache]: Analyzing trace with hash 505201571, now seen corresponding path program 110 times [2018-10-01 00:47:34,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:34,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:34,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:34,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:47:34,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 24420 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 12210 trivial. 0 not checked. [2018-10-01 00:47:35,136 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:35,136 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:35,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:47:35,321 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:47:35,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:35,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 24420 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 12210 trivial. 0 not checked. [2018-10-01 00:47:35,835 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:35,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2018-10-01 00:47:35,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-01 00:47:35,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-01 00:47:35,837 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:35,837 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 113 states. [2018-10-01 00:47:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:39,791 INFO L93 Difference]: Finished difference Result 675 states and 678 transitions. [2018-10-01 00:47:39,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-01 00:47:39,791 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 446 [2018-10-01 00:47:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:39,792 INFO L225 Difference]: With dead ends: 675 [2018-10-01 00:47:39,792 INFO L226 Difference]: Without dead ends: 451 [2018-10-01 00:47:39,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:47:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-10-01 00:47:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2018-10-01 00:47:39,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-01 00:47:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 452 transitions. [2018-10-01 00:47:39,798 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 452 transitions. Word has length 446 [2018-10-01 00:47:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:39,798 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 452 transitions. [2018-10-01 00:47:39,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-01 00:47:39,798 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 452 transitions. [2018-10-01 00:47:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-01 00:47:39,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:39,800 INFO L375 BasicCegarLoop]: trace histogram [112, 112, 111, 111, 1, 1, 1, 1] [2018-10-01 00:47:39,800 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:39,800 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:39,800 INFO L82 PathProgramCache]: Analyzing trace with hash 357787159, now seen corresponding path program 111 times [2018-10-01 00:47:39,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:39,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:39,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:39,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:39,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 12432 trivial. 0 not checked. [2018-10-01 00:47:40,831 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:40,831 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:40,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:48:01,782 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 112 check-sat command(s) [2018-10-01 00:48:01,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:01,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 12432 trivial. 0 not checked. [2018-10-01 00:48:02,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:02,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2018-10-01 00:48:02,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-01 00:48:02,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-01 00:48:02,301 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:02,302 INFO L87 Difference]: Start difference. First operand 451 states and 452 transitions. Second operand 114 states. [2018-10-01 00:48:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:06,926 INFO L93 Difference]: Finished difference Result 681 states and 684 transitions. [2018-10-01 00:48:06,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-01 00:48:06,926 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 450 [2018-10-01 00:48:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:06,927 INFO L225 Difference]: With dead ends: 681 [2018-10-01 00:48:06,927 INFO L226 Difference]: Without dead ends: 455 [2018-10-01 00:48:06,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:48:06,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-10-01 00:48:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2018-10-01 00:48:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-01 00:48:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2018-10-01 00:48:06,932 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 450 [2018-10-01 00:48:06,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:06,933 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2018-10-01 00:48:06,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-01 00:48:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2018-10-01 00:48:06,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-10-01 00:48:06,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:06,934 INFO L375 BasicCegarLoop]: trace histogram [113, 113, 112, 112, 1, 1, 1, 1] [2018-10-01 00:48:06,935 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:06,935 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:06,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2017414795, now seen corresponding path program 112 times [2018-10-01 00:48:06,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:06,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:06,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:06,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:06,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 12656 trivial. 0 not checked. [2018-10-01 00:48:07,757 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:07,757 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:07,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:48:07,941 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:48:07,941 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:07,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 12656 trivial. 0 not checked. [2018-10-01 00:48:08,447 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:08,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 114 [2018-10-01 00:48:08,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-01 00:48:08,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-01 00:48:08,448 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:08,449 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 115 states. [2018-10-01 00:48:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:13,110 INFO L93 Difference]: Finished difference Result 687 states and 690 transitions. [2018-10-01 00:48:13,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-01 00:48:13,111 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 454 [2018-10-01 00:48:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:13,111 INFO L225 Difference]: With dead ends: 687 [2018-10-01 00:48:13,111 INFO L226 Difference]: Without dead ends: 459 [2018-10-01 00:48:13,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:48:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-01 00:48:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2018-10-01 00:48:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-10-01 00:48:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 460 transitions. [2018-10-01 00:48:13,117 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 460 transitions. Word has length 454 [2018-10-01 00:48:13,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:13,117 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 460 transitions. [2018-10-01 00:48:13,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-01 00:48:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 460 transitions. [2018-10-01 00:48:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-10-01 00:48:13,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:13,119 INFO L375 BasicCegarLoop]: trace histogram [114, 114, 113, 113, 1, 1, 1, 1] [2018-10-01 00:48:13,119 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:13,120 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:13,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1335526145, now seen corresponding path program 113 times [2018-10-01 00:48:13,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:13,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:13,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 12882 trivial. 0 not checked. [2018-10-01 00:48:14,036 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:14,037 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:14,044 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:48:52,601 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 114 check-sat command(s) [2018-10-01 00:48:52,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:52,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 12882 trivial. 0 not checked. [2018-10-01 00:48:53,270 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:53,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2018-10-01 00:48:53,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-01 00:48:53,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-01 00:48:53,272 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:53,272 INFO L87 Difference]: Start difference. First operand 459 states and 460 transitions. Second operand 116 states. [2018-10-01 00:48:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:58,653 INFO L93 Difference]: Finished difference Result 693 states and 696 transitions. [2018-10-01 00:48:58,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-01 00:48:58,654 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 458 [2018-10-01 00:48:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:58,655 INFO L225 Difference]: With dead ends: 693 [2018-10-01 00:48:58,655 INFO L226 Difference]: Without dead ends: 463 [2018-10-01 00:48:58,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:48:58,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-10-01 00:48:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2018-10-01 00:48:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-10-01 00:48:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2018-10-01 00:48:58,661 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 458 [2018-10-01 00:48:58,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:58,661 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2018-10-01 00:48:58,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-01 00:48:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2018-10-01 00:48:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-10-01 00:48:58,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:58,663 INFO L375 BasicCegarLoop]: trace histogram [115, 115, 114, 114, 1, 1, 1, 1] [2018-10-01 00:48:58,663 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:58,663 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:58,663 INFO L82 PathProgramCache]: Analyzing trace with hash -691342989, now seen corresponding path program 114 times [2018-10-01 00:48:58,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:58,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:58,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:58,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:58,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 13110 trivial. 0 not checked. [2018-10-01 00:48:59,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:59,581 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:59,588 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:49:14,739 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 115 check-sat command(s) [2018-10-01 00:49:14,739 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:49:14,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 13110 trivial. 0 not checked. [2018-10-01 00:49:15,275 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:15,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2018-10-01 00:49:15,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-01 00:49:15,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-01 00:49:15,277 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:15,277 INFO L87 Difference]: Start difference. First operand 463 states and 464 transitions. Second operand 117 states. [2018-10-01 00:49:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:20,069 INFO L93 Difference]: Finished difference Result 699 states and 702 transitions. [2018-10-01 00:49:20,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-01 00:49:20,069 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 462 [2018-10-01 00:49:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:20,070 INFO L225 Difference]: With dead ends: 699 [2018-10-01 00:49:20,070 INFO L226 Difference]: Without dead ends: 467 [2018-10-01 00:49:20,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:49:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-01 00:49:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2018-10-01 00:49:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-10-01 00:49:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 468 transitions. [2018-10-01 00:49:20,075 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 468 transitions. Word has length 462 [2018-10-01 00:49:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:20,076 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 468 transitions. [2018-10-01 00:49:20,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-01 00:49:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 468 transitions. [2018-10-01 00:49:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-01 00:49:20,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:20,077 INFO L375 BasicCegarLoop]: trace histogram [116, 116, 115, 115, 1, 1, 1, 1] [2018-10-01 00:49:20,078 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:20,078 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:20,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1945414631, now seen corresponding path program 115 times [2018-10-01 00:49:20,078 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:20,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:20,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:20,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:20,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 13340 trivial. 0 not checked. [2018-10-01 00:49:20,966 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:20,966 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:20,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:49:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:21,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 13340 trivial. 0 not checked. [2018-10-01 00:49:21,686 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:21,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 117 [2018-10-01 00:49:21,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-01 00:49:21,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-01 00:49:21,688 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:21,688 INFO L87 Difference]: Start difference. First operand 467 states and 468 transitions. Second operand 118 states. [2018-10-01 00:49:26,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:26,224 INFO L93 Difference]: Finished difference Result 705 states and 708 transitions. [2018-10-01 00:49:26,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-10-01 00:49:26,224 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 466 [2018-10-01 00:49:26,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:26,225 INFO L225 Difference]: With dead ends: 705 [2018-10-01 00:49:26,226 INFO L226 Difference]: Without dead ends: 471 [2018-10-01 00:49:26,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:49:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-10-01 00:49:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2018-10-01 00:49:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-10-01 00:49:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 472 transitions. [2018-10-01 00:49:26,231 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 472 transitions. Word has length 466 [2018-10-01 00:49:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:26,231 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 472 transitions. [2018-10-01 00:49:26,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-01 00:49:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 472 transitions. [2018-10-01 00:49:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-10-01 00:49:26,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:26,233 INFO L375 BasicCegarLoop]: trace histogram [117, 117, 116, 116, 1, 1, 1, 1] [2018-10-01 00:49:26,233 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:26,234 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:26,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1072147547, now seen corresponding path program 116 times [2018-10-01 00:49:26,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:26,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:26,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:26,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:49:26,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 27144 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 13572 trivial. 0 not checked. [2018-10-01 00:49:27,214 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:27,214 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:27,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:49:27,413 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:49:27,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:49:27,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 27144 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 13572 trivial. 0 not checked. [2018-10-01 00:49:28,046 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:28,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 118 [2018-10-01 00:49:28,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-01 00:49:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-01 00:49:28,048 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:28,048 INFO L87 Difference]: Start difference. First operand 471 states and 472 transitions. Second operand 119 states. [2018-10-01 00:49:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:32,539 INFO L93 Difference]: Finished difference Result 711 states and 714 transitions. [2018-10-01 00:49:32,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-01 00:49:32,539 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 470 [2018-10-01 00:49:32,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:32,540 INFO L225 Difference]: With dead ends: 711 [2018-10-01 00:49:32,540 INFO L226 Difference]: Without dead ends: 475 [2018-10-01 00:49:32,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:49:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-10-01 00:49:32,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2018-10-01 00:49:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-01 00:49:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 476 transitions. [2018-10-01 00:49:32,546 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 476 transitions. Word has length 470 [2018-10-01 00:49:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:32,546 INFO L480 AbstractCegarLoop]: Abstraction has 475 states and 476 transitions. [2018-10-01 00:49:32,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-01 00:49:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 476 transitions. [2018-10-01 00:49:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-01 00:49:32,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:32,548 INFO L375 BasicCegarLoop]: trace histogram [118, 118, 117, 117, 1, 1, 1, 1] [2018-10-01 00:49:32,548 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:32,548 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:32,548 INFO L82 PathProgramCache]: Analyzing trace with hash -500632881, now seen corresponding path program 117 times [2018-10-01 00:49:32,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:32,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:32,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:32,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:32,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 13806 trivial. 0 not checked. [2018-10-01 00:49:33,510 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:33,510 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:33,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:49:59,824 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 118 check-sat command(s) [2018-10-01 00:49:59,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:49:59,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:50:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 13806 trivial. 0 not checked. [2018-10-01 00:50:00,372 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:50:00,373 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2018-10-01 00:50:00,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-01 00:50:00,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-01 00:50:00,374 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:50:00,374 INFO L87 Difference]: Start difference. First operand 475 states and 476 transitions. Second operand 120 states. [2018-10-01 00:50:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:50:04,577 INFO L93 Difference]: Finished difference Result 717 states and 720 transitions. [2018-10-01 00:50:04,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-01 00:50:04,578 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 474 [2018-10-01 00:50:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:50:04,579 INFO L225 Difference]: With dead ends: 717 [2018-10-01 00:50:04,579 INFO L226 Difference]: Without dead ends: 479 [2018-10-01 00:50:04,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:50:04,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-01 00:50:04,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2018-10-01 00:50:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-01 00:50:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 480 transitions. [2018-10-01 00:50:04,586 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 480 transitions. Word has length 474 [2018-10-01 00:50:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:50:04,587 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 480 transitions. [2018-10-01 00:50:04,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-01 00:50:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 480 transitions. [2018-10-01 00:50:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-01 00:50:04,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:50:04,588 INFO L375 BasicCegarLoop]: trace histogram [119, 119, 118, 118, 1, 1, 1, 1] [2018-10-01 00:50:04,588 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:50:04,589 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:50:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1312981181, now seen corresponding path program 118 times [2018-10-01 00:50:04,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:50:04,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:50:04,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:04,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:50:04,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 14042 trivial. 0 not checked. [2018-10-01 00:50:05,503 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:50:05,503 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:50:05,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:50:05,696 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:50:05,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:50:05,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:50:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 14042 trivial. 0 not checked. [2018-10-01 00:50:06,244 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:50:06,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 120 [2018-10-01 00:50:06,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-01 00:50:06,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-01 00:50:06,246 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:50:06,246 INFO L87 Difference]: Start difference. First operand 479 states and 480 transitions. Second operand 121 states. [2018-10-01 00:50:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:50:10,891 INFO L93 Difference]: Finished difference Result 723 states and 726 transitions. [2018-10-01 00:50:10,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-01 00:50:10,892 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 478 [2018-10-01 00:50:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:50:10,893 INFO L225 Difference]: With dead ends: 723 [2018-10-01 00:50:10,893 INFO L226 Difference]: Without dead ends: 483 [2018-10-01 00:50:10,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:50:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-10-01 00:50:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2018-10-01 00:50:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-10-01 00:50:10,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 484 transitions. [2018-10-01 00:50:10,899 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 484 transitions. Word has length 478 [2018-10-01 00:50:10,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:50:10,899 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 484 transitions. [2018-10-01 00:50:10,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-01 00:50:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 484 transitions. [2018-10-01 00:50:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-10-01 00:50:10,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:50:10,901 INFO L375 BasicCegarLoop]: trace histogram [120, 120, 119, 119, 1, 1, 1, 1] [2018-10-01 00:50:10,901 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:50:10,902 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:50:10,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1965707703, now seen corresponding path program 119 times [2018-10-01 00:50:10,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:50:10,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:50:10,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:10,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:50:10,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2018-10-01 00:50:11,809 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:50:11,809 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:50:11,817 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:50:57,357 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 120 check-sat command(s) [2018-10-01 00:50:57,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:50:57,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:50:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2018-10-01 00:50:57,886 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:50:57,886 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 121 [2018-10-01 00:50:57,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-01 00:50:57,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-01 00:50:57,887 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:50:57,888 INFO L87 Difference]: Start difference. First operand 483 states and 484 transitions. Second operand 122 states. [2018-10-01 00:51:03,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:03,088 INFO L93 Difference]: Finished difference Result 729 states and 732 transitions. [2018-10-01 00:51:03,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-01 00:51:03,089 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 482 [2018-10-01 00:51:03,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:03,090 INFO L225 Difference]: With dead ends: 729 [2018-10-01 00:51:03,090 INFO L226 Difference]: Without dead ends: 487 [2018-10-01 00:51:03,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:51:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-10-01 00:51:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2018-10-01 00:51:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-10-01 00:51:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2018-10-01 00:51:03,097 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 482 [2018-10-01 00:51:03,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:03,097 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 488 transitions. [2018-10-01 00:51:03,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-01 00:51:03,098 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 488 transitions. [2018-10-01 00:51:03,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-10-01 00:51:03,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:03,099 INFO L375 BasicCegarLoop]: trace histogram [121, 121, 120, 120, 1, 1, 1, 1] [2018-10-01 00:51:03,100 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:03,100 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:03,100 INFO L82 PathProgramCache]: Analyzing trace with hash 578054699, now seen corresponding path program 120 times [2018-10-01 00:51:03,100 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:03,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:03,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:03,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:51:03,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 29040 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 14520 trivial. 0 not checked. [2018-10-01 00:51:04,069 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:51:04,069 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:51:04,076 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:51:33,219 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 121 check-sat command(s) [2018-10-01 00:51:33,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:51:33,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 29040 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 14520 trivial. 0 not checked. [2018-10-01 00:51:33,800 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:33,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122, 122] total 122 [2018-10-01 00:51:33,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-01 00:51:33,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-01 00:51:33,802 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:33,802 INFO L87 Difference]: Start difference. First operand 487 states and 488 transitions. Second operand 123 states. [2018-10-01 00:51:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:39,148 INFO L93 Difference]: Finished difference Result 735 states and 738 transitions. [2018-10-01 00:51:39,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-01 00:51:39,149 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 486 [2018-10-01 00:51:39,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:39,150 INFO L225 Difference]: With dead ends: 735 [2018-10-01 00:51:39,150 INFO L226 Difference]: Without dead ends: 491 [2018-10-01 00:51:39,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:51:39,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-10-01 00:51:39,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2018-10-01 00:51:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-10-01 00:51:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 492 transitions. [2018-10-01 00:51:39,156 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 492 transitions. Word has length 486 [2018-10-01 00:51:39,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:39,156 INFO L480 AbstractCegarLoop]: Abstraction has 491 states and 492 transitions. [2018-10-01 00:51:39,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-01 00:51:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 492 transitions. [2018-10-01 00:51:39,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-10-01 00:51:39,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:39,158 INFO L375 BasicCegarLoop]: trace histogram [122, 122, 121, 121, 1, 1, 1, 1] [2018-10-01 00:51:39,158 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:39,159 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:39,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1625241441, now seen corresponding path program 121 times [2018-10-01 00:51:39,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:39,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:39,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:39,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:51:39,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 14762 trivial. 0 not checked. [2018-10-01 00:51:40,121 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:51:40,121 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:51:40,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:51:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:40,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 14762 trivial. 0 not checked. [2018-10-01 00:51:41,115 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:41,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 123 [2018-10-01 00:51:41,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-01 00:51:41,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-01 00:51:41,117 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:41,118 INFO L87 Difference]: Start difference. First operand 491 states and 492 transitions. Second operand 124 states. [2018-10-01 00:51:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:46,238 INFO L93 Difference]: Finished difference Result 741 states and 744 transitions. [2018-10-01 00:51:46,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-10-01 00:51:46,238 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 490 [2018-10-01 00:51:46,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:46,239 INFO L225 Difference]: With dead ends: 741 [2018-10-01 00:51:46,239 INFO L226 Difference]: Without dead ends: 495 [2018-10-01 00:51:46,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:51:46,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-10-01 00:51:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2018-10-01 00:51:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-10-01 00:51:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2018-10-01 00:51:46,245 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 490 [2018-10-01 00:51:46,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:46,245 INFO L480 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2018-10-01 00:51:46,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-01 00:51:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2018-10-01 00:51:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2018-10-01 00:51:46,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:46,247 INFO L375 BasicCegarLoop]: trace histogram [123, 123, 122, 122, 1, 1, 1, 1] [2018-10-01 00:51:46,247 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:46,247 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:46,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2144047853, now seen corresponding path program 122 times [2018-10-01 00:51:46,248 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:46,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:46,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:46,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:51:46,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 15006 trivial. 0 not checked. [2018-10-01 00:51:47,190 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:51:47,190 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:51:47,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:51:47,404 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:51:47,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:51:47,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 15006 trivial. 0 not checked. [2018-10-01 00:51:48,103 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:48,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 124] total 124 [2018-10-01 00:51:48,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-01 00:51:48,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-01 00:51:48,105 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:48,105 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 125 states. [2018-10-01 00:51:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:53,721 INFO L93 Difference]: Finished difference Result 747 states and 750 transitions. [2018-10-01 00:51:53,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-01 00:51:53,721 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 494 [2018-10-01 00:51:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:53,723 INFO L225 Difference]: With dead ends: 747 [2018-10-01 00:51:53,723 INFO L226 Difference]: Without dead ends: 499 [2018-10-01 00:51:53,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:51:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-10-01 00:51:53,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2018-10-01 00:51:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-10-01 00:51:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 500 transitions. [2018-10-01 00:51:53,731 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 500 transitions. Word has length 494 [2018-10-01 00:51:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:53,731 INFO L480 AbstractCegarLoop]: Abstraction has 499 states and 500 transitions. [2018-10-01 00:51:53,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-01 00:51:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 500 transitions. [2018-10-01 00:51:53,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-10-01 00:51:53,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:53,734 INFO L375 BasicCegarLoop]: trace histogram [124, 124, 123, 123, 1, 1, 1, 1] [2018-10-01 00:51:53,734 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:53,734 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:53,735 INFO L82 PathProgramCache]: Analyzing trace with hash -902539385, now seen corresponding path program 123 times [2018-10-01 00:51:53,735 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:53,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:53,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:53,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:51:53,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 15252 trivial. 0 not checked. [2018-10-01 00:51:54,782 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:51:54,782 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:51:54,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:52:25,335 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 124 check-sat command(s) [2018-10-01 00:52:25,335 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:25,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 15252 trivial. 0 not checked. [2018-10-01 00:52:25,878 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:25,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 125 [2018-10-01 00:52:25,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-01 00:52:25,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-01 00:52:25,880 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:25,880 INFO L87 Difference]: Start difference. First operand 499 states and 500 transitions. Second operand 126 states. [2018-10-01 00:52:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:30,647 INFO L93 Difference]: Finished difference Result 753 states and 756 transitions. [2018-10-01 00:52:30,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-01 00:52:30,647 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 498 [2018-10-01 00:52:30,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:30,648 INFO L225 Difference]: With dead ends: 753 [2018-10-01 00:52:30,648 INFO L226 Difference]: Without dead ends: 503 [2018-10-01 00:52:30,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:52:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-10-01 00:52:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2018-10-01 00:52:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-10-01 00:52:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2018-10-01 00:52:30,654 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 498 [2018-10-01 00:52:30,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:30,655 INFO L480 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2018-10-01 00:52:30,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-01 00:52:30,655 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2018-10-01 00:52:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-10-01 00:52:30,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:30,657 INFO L375 BasicCegarLoop]: trace histogram [125, 125, 124, 124, 1, 1, 1, 1] [2018-10-01 00:52:30,657 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:30,657 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:30,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1322940421, now seen corresponding path program 124 times [2018-10-01 00:52:30,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:30,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:30,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 15500 trivial. 0 not checked. [2018-10-01 00:52:31,701 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:31,701 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:31,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:52:31,916 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:52:31,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:31,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 15500 trivial. 0 not checked. [2018-10-01 00:52:32,609 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:32,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126, 126] total 126 [2018-10-01 00:52:32,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-01 00:52:32,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-01 00:52:32,611 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:32,611 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 127 states. [2018-10-01 00:52:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:37,647 INFO L93 Difference]: Finished difference Result 759 states and 762 transitions. [2018-10-01 00:52:37,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-10-01 00:52:37,647 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 502 [2018-10-01 00:52:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:37,648 INFO L225 Difference]: With dead ends: 759 [2018-10-01 00:52:37,648 INFO L226 Difference]: Without dead ends: 507 [2018-10-01 00:52:37,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:52:37,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-10-01 00:52:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2018-10-01 00:52:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-10-01 00:52:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 508 transitions. [2018-10-01 00:52:37,654 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 508 transitions. Word has length 502 [2018-10-01 00:52:37,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:37,654 INFO L480 AbstractCegarLoop]: Abstraction has 507 states and 508 transitions. [2018-10-01 00:52:37,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-01 00:52:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 508 transitions. [2018-10-01 00:52:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-10-01 00:52:37,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:37,657 INFO L375 BasicCegarLoop]: trace histogram [126, 126, 125, 125, 1, 1, 1, 1] [2018-10-01 00:52:37,657 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:37,657 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:37,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1485635183, now seen corresponding path program 125 times [2018-10-01 00:52:37,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:37,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:37,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:37,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:37,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 15750 trivial. 0 not checked. [2018-10-01 00:52:38,652 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:38,652 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:38,660 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown