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/diamond1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:47:00,050 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:47:00,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:47:00,063 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:47:00,064 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:47:00,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:47:00,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:47:00,074 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:47:00,076 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:47:00,077 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:47:00,078 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:47:00,078 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:47:00,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:47:00,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:47:00,081 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:47:00,082 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:47:00,083 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:47:00,085 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:47:00,087 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:47:00,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:47:00,089 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:47:00,090 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:47:00,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:47:00,093 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:47:00,093 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:47:00,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:47:00,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:47:00,096 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:47:00,097 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:47:00,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:47:00,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:47:00,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:47:00,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:47:00,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:47:00,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:47:00,104 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:47:00,104 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-04 12:47:00,127 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:47:00,127 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:47:00,128 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:47:00,128 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:47:00,129 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:47:00,129 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:47:00,129 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:47:00,129 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:47:00,129 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:47:00,130 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:47:00,130 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:47:00,130 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:47:00,130 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:47:00,130 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:47:00,131 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:47:00,131 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:47:00,131 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:47:00,131 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:47:00,131 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:47:00,132 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:47:00,132 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:47:00,132 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:47:00,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:47:00,132 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:47:00,133 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:47:00,133 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:47:00,133 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:47:00,133 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:47:00,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:47:00,134 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:47:00,134 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:47:00,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:47:00,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:47:00,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:47:00,219 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:47:00,220 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:47:00,220 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl [2018-10-04 12:47:00,221 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl' [2018-10-04 12:47:00,278 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:47:00,279 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:47:00,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:47:00,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:47:00,281 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:47:00,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:00" (1/1) ... [2018-10-04 12:47:00,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:00" (1/1) ... [2018-10-04 12:47:00,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:47:00,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:47:00,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:47:00,320 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:47:00,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:00" (1/1) ... [2018-10-04 12:47:00,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:00" (1/1) ... [2018-10-04 12:47:00,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:00" (1/1) ... [2018-10-04 12:47:00,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:00" (1/1) ... [2018-10-04 12:47:00,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:00" (1/1) ... [2018-10-04 12:47:00,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:00" (1/1) ... [2018-10-04 12:47:00,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:00" (1/1) ... [2018-10-04 12:47:00,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:47:00,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:47:00,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:47:00,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:47:00,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:00" (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-04 12:47:00,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:47:00,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:47:00,646 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:47:00,647 INFO L202 PluginConnector]: Adding new model diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:47:00 BoogieIcfgContainer [2018-10-04 12:47:00,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:47:00,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:47:00,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:47:00,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:47:00,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:47:00" (1/2) ... [2018-10-04 12:47:00,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d02323 and model type diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:47:00, skipping insertion in model container [2018-10-04 12:47:00,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:47:00" (2/2) ... [2018-10-04 12:47:00,655 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond1.i_3.bpl [2018-10-04 12:47:00,665 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:47:00,674 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:47:00,728 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:47:00,729 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:47:00,729 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:47:00,730 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:47:00,730 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:47:00,730 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:47:00,730 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:47:00,730 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:47:00,731 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:47:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 12:47:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:47:00,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:00,755 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:47:00,757 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:00,766 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-04 12:47:00,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:00,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:00,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:00,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:00,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:00,992 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-04 12:47:00,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:47:00,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:47:00,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:47:01,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:47:01,012 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:01,014 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 12:47:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:01,046 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-04 12:47:01,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:47:01,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-04 12:47:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:01,059 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:47:01,060 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:47:01,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:47:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:47:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:47:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:47:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:47:01,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-04 12:47:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:01,096 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:47:01,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:47:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:47:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:47:01,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:01,097 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-04 12:47:01,098 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:01,098 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:01,098 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-04 12:47:01,098 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:01,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:01,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:01,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:01,304 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-04 12:47:01,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:01,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:01,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:01,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:47:01,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:47:01,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:47:01,437 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:01,437 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-10-04 12:47:01,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:01,483 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:47:01,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:47:01,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-04 12:47:01,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:01,485 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:47:01,486 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:47:01,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 12:47:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:47:01,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:47:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:47:01,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:47:01,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-04 12:47:01,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:01,493 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:47:01,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:47:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:47:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:47:01,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:01,494 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-04 12:47:01,496 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:01,496 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:01,496 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-04 12:47:01,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:01,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:01,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:01,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:01,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47: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 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-04 12:47:01,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:47:01,709 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:47:01,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:01,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:01,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:01,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:47:01,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:47:01,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:47:01,795 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:01,795 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-10-04 12:47:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:01,880 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 12:47:01,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:47:01,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-04 12:47:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:01,882 INFO L225 Difference]: With dead ends: 13 [2018-10-04 12:47:01,882 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:47:01,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 12:47:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:47:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:47:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:47:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:47:01,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-04 12:47:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:01,889 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:47:01,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:47:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:47:01,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:47:01,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:01,890 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-04 12:47:01,891 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:01,891 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:01,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-04 12:47:01,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:01,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:01,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:01,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:01,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:02,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:02,093 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-04 12:47:02,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:47:02,162 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:47:02,162 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:02,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:02,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:02,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:47:02,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:47:02,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:47:02,401 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:02,401 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-04 12:47:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:02,452 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 12:47:02,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:47:02,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-04 12:47:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:02,454 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:47:02,454 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:47:02,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 4 [2018-10-04 12:47:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:47:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 12:47:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 12:47:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 12:47:02,459 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-04 12:47:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:02,460 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 12:47:02,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:47:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 12:47:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:47:02,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:02,461 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-04 12:47:02,461 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:02,461 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:02,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-04 12:47:02,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:02,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:02,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:02,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:02,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:02,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:02,697 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-04 12:47:02,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:47:02,720 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:47:02,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:02,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:02,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:02,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:47:02,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:47:02,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:47:02,803 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:02,803 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-10-04 12:47:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:02,951 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 12:47:02,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:47:02,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-10-04 12:47:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:02,953 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:47:02,953 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:47:02,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 12:47:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:47:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 12:47:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 12:47:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 12:47:02,958 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-04 12:47:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:02,959 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 12:47:02,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:47:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 12:47:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:47:02,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:02,960 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-04 12:47:02,960 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:02,960 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:02,960 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-04 12:47:02,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:02,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:02,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:02,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:02,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:03,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:03,565 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-04 12:47:03,575 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:47:03,631 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:47:03,631 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:03,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:03,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:03,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:47:03,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:47:03,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:47:03,784 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:03,784 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-10-04 12:47:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:03,866 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 12:47:03,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:47:03,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-04 12:47:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:03,869 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:47:03,869 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:47:03,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 6 [2018-10-04 12:47:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:47:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 12:47:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:47:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 12:47:03,874 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-04 12:47:03,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:03,874 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 12:47:03,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:47:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 12:47:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:47:03,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:03,875 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-04 12:47:03,876 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:03,876 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:03,876 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-04 12:47:03,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:03,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:03,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:03,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:03,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:04,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:04,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-04 12:47:04,517 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:47:04,536 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:47:04,537 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:04,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:04,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:04,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:47:04,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:47:04,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:47:04,640 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:04,640 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-10-04 12:47:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:04,734 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 12:47:04,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:47:04,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 12:47:04,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:04,739 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:47:04,739 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:47:04,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 7 [2018-10-04 12:47:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:47:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 12:47:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:47:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 12:47:04,743 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-04 12:47:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:04,744 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 12:47:04,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:47:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 12:47:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:47:04,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:04,745 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-10-04 12:47:04,745 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:04,745 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-10-04 12:47:04,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:04,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:04,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:04,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:04,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:05,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:05,120 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-04 12:47:05,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:05,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:05,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:05,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:47:05,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:47:05,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:47:05,222 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:05,222 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-10-04 12:47:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:05,348 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 12:47:05,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:47:05,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-04 12:47:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:05,350 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:47:05,350 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:47:05,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 8 [2018-10-04 12:47:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:47:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 12:47:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:47:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 12:47:05,354 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-04 12:47:05,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:05,355 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 12:47:05,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:47:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 12:47:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:47:05,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:05,356 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-10-04 12:47:05,356 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:05,356 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-10-04 12:47:05,356 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:05,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:05,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:05,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:05,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:05,743 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-04 12:47:05,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:47:05,773 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:47:05,773 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:05,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:05,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:05,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:47:05,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:47:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:47:05,871 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:05,877 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-10-04 12:47:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:06,045 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 12:47:06,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:47:06,046 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 12:47:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:06,047 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:47:06,048 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:47:06,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 9 [2018-10-04 12:47:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:47:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 12:47:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 12:47:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 12:47:06,054 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-04 12:47:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:06,054 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 12:47:06,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:47:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 12:47:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:47:06,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:06,055 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-10-04 12:47:06,056 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:06,056 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-10-04 12:47:06,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:06,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:06,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:06,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:06,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:06,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:06,247 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-04 12:47:06,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:47:07,145 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 12:47:07,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:07,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:07,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:07,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 12:47:07,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:47:07,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:47:07,247 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:07,247 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-10-04 12:47:07,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:07,595 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 12:47:07,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:47:07,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-10-04 12:47:07,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:07,597 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:47:07,597 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:47:07,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 10 [2018-10-04 12:47:07,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:47:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 12:47:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:47:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 12:47:07,604 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-04 12:47:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:07,604 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 12:47:07,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:47:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 12:47:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:47:07,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:07,605 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-10-04 12:47:07,606 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:07,606 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-10-04 12:47:07,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:07,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:07,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:07,916 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:07,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:07,917 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-04 12:47:07,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:47:07,941 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:47:07,941 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:07,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:08,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:08,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 12:47:08,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:47:08,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:47:08,143 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:08,143 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-10-04 12:47:08,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:08,377 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 12:47:08,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:47:08,378 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-10-04 12:47:08,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:08,379 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:47:08,379 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:47:08,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 11 [2018-10-04 12:47:08,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:47:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 12:47:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 12:47:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 12:47:08,385 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-04 12:47:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:08,386 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 12:47:08,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:47:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 12:47:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:47:08,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:08,387 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-10-04 12:47:08,387 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:08,387 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:08,388 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-10-04 12:47:08,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:08,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:08,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:08,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:08,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:08,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:08,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 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-04 12:47:08,857 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:47:08,985 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 12:47:08,985 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:08,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:09,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:09,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 12:47:09,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:47:09,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:47:09,224 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:09,224 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-04 12:47:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:09,404 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 12:47:09,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:47:09,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-04 12:47:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:09,409 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:47:09,409 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:47:09,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 12 [2018-10-04 12:47:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:47:09,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 12:47:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:47:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 12:47:09,415 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-04 12:47:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:09,415 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 12:47:09,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:47:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 12:47:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:47:09,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:09,417 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-10-04 12:47:09,417 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:09,417 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:09,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-10-04 12:47:09,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:09,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:09,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:09,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:09,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:09,692 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:09,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:09,692 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-04 12:47:09,700 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:47:10,765 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:47:10,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:10,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:10,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:10,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 12:47:10,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:47:10,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:47:10,918 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:10,918 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-10-04 12:47:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:11,100 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 12:47:11,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:47:11,102 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-10-04 12:47:11,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:11,103 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:47:11,103 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:47:11,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 13 [2018-10-04 12:47:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:47:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 12:47:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 12:47:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 12:47:11,108 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-04 12:47:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:11,108 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 12:47:11,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:47:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 12:47:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:47:11,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:11,109 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-10-04 12:47:11,110 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:11,110 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:11,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-10-04 12:47:11,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:11,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:11,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:11,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:11,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:12,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:12,070 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-04 12:47:12,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:12,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:12,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:12,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 12:47:12,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:47:12,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:47:12,314 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:12,315 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-10-04 12:47:12,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:12,501 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 12:47:12,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:47:12,501 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-10-04 12:47:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:12,502 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:47:12,503 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:47:12,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 14 [2018-10-04 12:47:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:47:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 12:47:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:47:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 12:47:12,510 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-04 12:47:12,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:12,510 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 12:47:12,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:47:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 12:47:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:47:12,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:12,512 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-10-04 12:47:12,512 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:12,512 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:12,512 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-10-04 12:47:12,512 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:12,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:12,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:13,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:13,064 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-04 12:47:13,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:47:13,093 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:47:13,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:13,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:13,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:13,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 12:47:13,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:47:13,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:47:13,657 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:13,657 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-10-04 12:47:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:13,899 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 12:47:13,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:47:13,899 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-10-04 12:47:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:13,900 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:47:13,901 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:47:13,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.3s impTime 15 [2018-10-04 12:47:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:47:13,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 12:47:13,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:47:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 12:47:13,906 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-04 12:47:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:13,907 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 12:47:13,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:47:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 12:47:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:47:13,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:13,908 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-10-04 12:47:13,908 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:13,908 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:13,908 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-10-04 12:47:13,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:13,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:13,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:13,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:13,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:14,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:14,178 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-04 12:47:14,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:47:15,457 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 12:47:15,458 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:15,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:15,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:15,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 12:47:15,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:47:15,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:47:15,581 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:15,581 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-10-04 12:47:15,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:15,800 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 12:47:15,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:47:15,800 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-10-04 12:47:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:15,801 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:47:15,802 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:47:15,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 16 [2018-10-04 12:47:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:47:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 12:47:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:47:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 12:47:15,808 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-04 12:47:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:15,809 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 12:47:15,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:47:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 12:47:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:47:15,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:15,810 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-10-04 12:47:15,810 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:15,810 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:15,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-10-04 12:47:15,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:15,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:15,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:15,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:15,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:16,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:16,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 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-04 12:47:16,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:47:16,162 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:47:16,163 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:16,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:16,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:16,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 12:47:16,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:47:16,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:47:16,360 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:16,361 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-10-04 12:47:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:16,683 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 12:47:16,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:47:16,691 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-10-04 12:47:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:16,692 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:47:16,692 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:47:16,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 17 [2018-10-04 12:47:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:47:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 12:47:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 12:47:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 12:47:16,701 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-10-04 12:47:16,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:16,702 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 12:47:16,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:47:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 12:47:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 12:47:16,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:16,703 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-10-04 12:47:16,703 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:16,703 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:16,703 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-10-04 12:47:16,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:16,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:16,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:16,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:16,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:17,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:17,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 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-04 12:47:17,095 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:47:52,466 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 12:47:52,466 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:52,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:52,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:52,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 12:47:52,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:47:52,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:47:52,880 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:52,880 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-10-04 12:47:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:53,171 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 12:47:53,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:47:53,171 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-10-04 12:47:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:53,172 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:47:53,172 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:47:53,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 18 [2018-10-04 12:47:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:47:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 12:47:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 12:47:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 12:47:53,179 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-10-04 12:47:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:53,179 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 12:47:53,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:47:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 12:47:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 12:47:53,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:53,180 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-10-04 12:47:53,181 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:53,181 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-10-04 12:47:53,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:53,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:53,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:53,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:53,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:53,526 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:47:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:53,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:53,531 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:47:53,538 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:47:54,695 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 12:47:54,695 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:54,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:54,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:54,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 12:47:54,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:47:54,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:47:54,878 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:54,879 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-10-04 12:47:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:55,536 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 12:47:55,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:47:55,537 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-10-04 12:47:55,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:55,538 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:47:55,538 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:47:55,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 19 [2018-10-04 12:47:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:47:55,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 12:47:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 12:47:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 12:47:55,544 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-10-04 12:47:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:55,544 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 12:47:55,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:47:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 12:47:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 12:47:55,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:55,545 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-10-04 12:47:55,545 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:55,546 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:55,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-10-04 12:47:55,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:55,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:55,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:56,394 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:47:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:56,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:56,422 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-04 12:47:56,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:56,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:56,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:56,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 12:47:56,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:47:56,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:47:56,562 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:56,562 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-10-04 12:47:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:57,003 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 12:47:57,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:47:57,004 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-10-04 12:47:57,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:57,005 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:47:57,005 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:47:57,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime 20 [2018-10-04 12:47:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:47:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 12:47:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 12:47:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 12:47:57,012 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-10-04 12:47:57,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:57,012 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 12:47:57,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:47:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 12:47:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:47:57,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:57,013 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-10-04 12:47:57,014 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:57,014 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:57,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-10-04 12:47:57,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:57,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:57,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:57,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:47:57,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:57,873 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:47:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:57,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:57,925 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:47:57,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:47:57,962 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:47:57,963 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:47:57,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:47:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:58,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:47:58,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 12:47:58,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 12:47:58,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 12:47:58,097 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:47:58,097 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-10-04 12:47:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:47:58,443 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-04 12:47:58,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:47:58,443 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-10-04 12:47:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:47:58,444 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:47:58,444 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:47:58,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 21 [2018-10-04 12:47:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:47:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 12:47:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 12:47:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-04 12:47:58,451 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-10-04 12:47:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:47:58,451 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-04 12:47:58,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 12:47:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-04 12:47:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 12:47:58,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:47:58,452 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-10-04 12:47:58,452 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:47:58,453 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:47:58,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-10-04 12:47:58,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:47:58,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:47:58,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:58,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:47:58,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:47:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:47:59,677 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:47:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:47:59,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:47:59,756 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-04 12:47:59,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:48:02,104 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 12:48:02,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:48:02,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:48:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:48:02,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:48:02,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 12:48:02,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:48:02,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:48:02,282 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:48:02,282 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-10-04 12:48:02,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:48:02,660 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-04 12:48:02,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:48:02,664 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-10-04 12:48:02,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:48:02,665 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:48:02,665 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:48:02,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 22 [2018-10-04 12:48:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:48:02,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-04 12:48:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 12:48:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-04 12:48:02,670 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-10-04 12:48:02,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:48:02,670 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-04 12:48:02,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:48:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-04 12:48:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 12:48:02,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:48:02,671 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-10-04 12:48:02,671 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:48:02,671 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:48:02,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-10-04 12:48:02,671 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:48:02,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:48:02,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:48:02,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:48:02,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:48:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:48:03,064 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:48:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:48:03,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:48:03,176 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-04 12:48:03,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:48:03,221 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:48:03,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:48:03,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:48:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:48:03,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:48:03,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 12:48:03,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 12:48:03,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 12:48:03,356 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:48:03,356 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-10-04 12:48:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:48:03,729 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-04 12:48:03,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:48:03,730 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-10-04 12:48:03,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:48:03,731 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:48:03,731 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:48:03,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 23 [2018-10-04 12:48:03,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:48:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 12:48:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 12:48:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-04 12:48:03,738 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-10-04 12:48:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:48:03,738 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-04 12:48:03,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 12:48:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-04 12:48:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 12:48:03,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:48:03,739 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-10-04 12:48:03,739 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:48:03,739 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:48:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-10-04 12:48:03,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:48:03,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:48:03,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:48:03,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:48:03,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:48:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:48:04,342 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:48:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:48:04,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:48:04,478 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-04 12:48:04,487 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:49:36,147 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 12:49:36,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:49:36,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:49:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:49:36,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:49:36,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 12:49:36,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 12:49:36,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 12:49:36,837 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:49:36,837 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-10-04 12:49:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:49:37,283 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-04 12:49:37,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:49:37,284 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-10-04 12:49:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:49:37,284 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:49:37,285 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:49:37,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 24 [2018-10-04 12:49:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:49:37,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-04 12:49:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 12:49:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-04 12:49:37,291 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-10-04 12:49:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:49:37,292 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-04 12:49:37,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 12:49:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-04 12:49:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 12:49:37,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:49:37,292 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-10-04 12:49:37,293 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:49:37,293 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:49:37,293 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-10-04 12:49:37,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:49:37,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:49:37,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:49:37,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:49:37,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:49:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:49:38,263 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:49:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:49:38,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:49:38,421 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-04 12:49:38,428 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:50:17,483 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 12:50:17,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:17,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:17,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:17,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 12:50:17,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 12:50:17,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 12:50:17,656 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:17,656 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-10-04 12:50:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:18,100 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-04 12:50:18,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:50:18,100 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-10-04 12:50:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:18,101 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:50:18,101 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:50:18,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 25 [2018-10-04 12:50:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:50:18,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 12:50:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 12:50:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-04 12:50:18,107 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-10-04 12:50:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:18,108 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-04 12:50:18,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 12:50:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-04 12:50:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 12:50:18,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:18,108 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-10-04 12:50:18,109 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:18,109 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:18,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-10-04 12:50:18,109 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:18,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:18,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:18,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:18,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:19,386 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:50:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:19,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:19,579 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-04 12:50:19,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:19,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:19,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:19,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 12:50:19,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 12:50:19,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 12:50:19,758 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:19,758 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-10-04 12:50:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:20,243 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-04 12:50:20,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:50:20,244 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-10-04 12:50:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:20,244 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:50:20,245 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:50:20,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime 26 [2018-10-04 12:50:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:50:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 12:50:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 12:50:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-04 12:50:20,250 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-10-04 12:50:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:20,251 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-04 12:50:20,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 12:50:20,251 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-04 12:50:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 12:50:20,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:20,251 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-10-04 12:50:20,252 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:20,252 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:20,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-10-04 12:50:20,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:20,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:20,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:20,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:20,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:20,569 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:50:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:20,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:20,797 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-04 12:50:20,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:50:20,831 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:50:20,831 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:20,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:21,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:21,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 12:50:21,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 12:50:21,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 12:50:21,123 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:21,123 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-10-04 12:50:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:21,700 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-04 12:50:21,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:50:21,701 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-10-04 12:50:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:21,702 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:50:21,702 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:50:21,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 27 [2018-10-04 12:50:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:50:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 12:50:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 12:50:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-04 12:50:21,706 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-10-04 12:50:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:21,706 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-04 12:50:21,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 12:50:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-04 12:50:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 12:50:21,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:21,707 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-10-04 12:50:21,707 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:21,707 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-10-04 12:50:21,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:21,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:21,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:21,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:21,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:22,263 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:50:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:22,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:22,529 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-04 12:50:22,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:50:40,932 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-04 12:50:40,932 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:40,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:41,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:41,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 12:50:41,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 12:50:41,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 12:50:41,118 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:41,118 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-10-04 12:50:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:41,847 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-04 12:50:41,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:50:41,848 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-10-04 12:50:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:41,849 INFO L225 Difference]: With dead ends: 63 [2018-10-04 12:50:41,849 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 12:50:41,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 28 [2018-10-04 12:50:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 12:50:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-04 12:50:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 12:50:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-04 12:50:41,854 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-10-04 12:50:41,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:41,854 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-04 12:50:41,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 12:50:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-04 12:50:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 12:50:41,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:41,854 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-10-04 12:50:41,855 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:41,855 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:41,855 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-10-04 12:50:41,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:41,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:41,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:41,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:41,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:42,385 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:50:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:42,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:42,676 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-04 12:50:42,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:50:42,715 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:50:42,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:42,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:42,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:42,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 12:50:42,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 12:50:42,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 12:50:42,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:42,876 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-10-04 12:50:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:43,490 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-04 12:50:43,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:50:43,491 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-10-04 12:50:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:43,492 INFO L225 Difference]: With dead ends: 65 [2018-10-04 12:50:43,492 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 12:50:43,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 29 [2018-10-04 12:50:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 12:50:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 12:50:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 12:50:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-04 12:50:43,497 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-10-04 12:50:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:43,497 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-04 12:50:43,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 12:50:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-04 12:50:43,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 12:50:43,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:43,498 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-10-04 12:50:43,498 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:43,499 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:43,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-10-04 12:50:43,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:43,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:43,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:43,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:43,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:44,580 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:50:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:44,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:44,925 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:44,933 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown